Reverse Regression and Employment Discrimination

The importance of interval forecasts is reviewed. Several general approaches to calculating such forecasts are described and compared. They include the use of theoretical formulas based on a fitted probability model (with or without a correction for parameter uncertainty), various “approximate” formulas (which should be avoided), and empirically based, simulation, and resampling procedures. The latter are useful when theoretical formulas are not available or there are doubts about some model assumptions. The distinction between a forecasting method and a forecasting model is expounded. For large groups of series, a forecasting method may be chosen in a fairly ad hoc way. With appropriate checks, it may be possible to base interval forecasts on the model for which the method is optimal. It is certainly unsound to use a model for which the method is not optimal, but, strangely, this is sometimes done. Some general comments are made as to why prediction intervals tend to be too narrow in practice to encompass the required proportion of future observations. An example demonstrates the overriding importance of careful model specification. In particular, when data are “nearly nonstationary,” the difference between fitting a stationary and a nonstationary model is critical.     

Unobserved-Components Models for Seasonal Adjustment Filters

Time series models are presented, for which the seasonal-component estimates delivered by linear least squares signal extraction closely approximate those of the standard option of the widely-used Census X-11 program. Earlier work is extended by consideration of a broader class of models and by examination of asymmetric filters, in addition to the symmetric filter implicit in the adjustment of historical data. Various criteria that guide the specification of unobserved- components models are discussed, and a new preferred model is presented. Some nonstandard options in X-11 are considered in the Appendix.     

Tests for Cointegration Breakdown Over a Short Time Period

We derive a speculative trading model with endogenous informed trading that yields a conditionally heteroscedastic time series for trading volume and the squared price changes. We use half-hourly price-change and volume data for IBM during 1988 to test the model and estimate the structural parameters using the simulated method-of-moments estimation procedure. Although the model seems to do a reasonable job fitting the unconditional moments of the volume and the squared price change processes, it fares less well in fitting the relation between current trading volume and lags of trading volume and squared volume's (and its lag's) relation to squared price changes.     

The Design of Scoring Schemes for Surveys Using the Block Total Response Method

ABSTRACT

In this article we investigate the design of scoring schemes for surveys using the block total response method. This method was first proposed by Raghavarao and Federer (1979 Raghavarao , D. , Federer , W. T. ( 1979 ). Block total response as an alternative to the randomized response method in surveys . J. Roy. Statist. Soc. 41 ( 1 ): 40 – 45 . [CSA] [CROSSREF]  [Google Scholar]) to provide accurate estimates of the base rates of sensitive characteristics using balanced incomplete block designs. The scoring scheme used in Raghavarao and Federer (1979 Raghavarao , D. , Federer , W. T. ( 1979 ). Block total response as an alternative to the randomized response method in surveys . J. Roy. Statist. Soc. 41 ( 1 ): 40 – 45 . [CSA] [CROSSREF]  [Google Scholar]) did not guarantee anonymity of answers and so the possibility of improving on this basic scoring scheme is considered in this article.     

A Similarity Measure Based on Species Proportions

ABSTRACT

There are several indices for measuring the similarity of two populations, including the ratio of the number of shared species to the number of distinct species (Jaccard's index) and the conditional probability of observing a shared species (Smith et al., 1996 Smith , W. , Solow , A. R. , Preston , P. E. ( 1996 ). An estimator of species overlap using a modified beta-binomial model. Biometrics 52 : 1472 – 1477 . [CSA] [CROSSREF] [Crossref], [Web of Science ®] , [Google Scholar]). However, these indices only take into account the number of species and species proportions of shared species. In this article, we propose a new similarity index which includes the species proportions of both the shared and non shared species in each population, and also propose a Nonparametric Maximum Likelihood Estimator (NPMLE) for this index. Bootstrap and delta methods are used to evaluate the standard errors of the NPMLE. Based on a loss function, we also compare a class of nonparametric estimators for the proposed index in various situations.     

ON SOME OPTIMALITY PROPERTIES OF FISHER-RAO SCORE FUNCTION IN TESTING AND ESTIMATION

The score function is associated with some optimality features in statistical inference. This review article looks on the central role of the score in testing and estimation. The maximization of the power in testing and the quest for efficiency in estimation lead to score as a guiding principle. In hypothesis testing, the locally most powerful test statistic is the score test or a transformation of it. In estimation, the optimal estimating function is the score. The same link can be made in the case of nuisance parameters: the optimal test function should have maximum correlation with the score of the parameter of primary interest. We complement this result by showing that the same criterion should be satisfied in the estimation problem as well.     

VARIANCE ESTIMATION IN NONPARAMETRIC MULTIPLE REGRESSION

ABSTRACT

We consider the variance estimation in a general nonparametric regression model with multiple covariates. We extend difference methods to the multivariate setting by introducing an algorithm that orders the design points in higher dimensions. We also consider an adaptive difference estimator which requires much less strict assumptions on the covariate design and can significantly reduce mean squared error for small sample sizes.     

Workload Process,Waiting Times,and Sojourn Times in a Discrete Time MMAP[K]/SM[K]/1/FCFS Queue

Abstract

In this paper, we study the total workload process and waiting times in a queueing system with multiple types of customers and a first-come-first-served service discipline. An M/G/1 type Markov chain, which is closely related to the total workload in the queueing system, is constructed. A method is developed for computing the steady state distribution of that Markov chain. Using that steady state distribution, the distributions of total workload, batch waiting times, and waiting times of individual types of customers are obtained. Compared to the GI/M/1 and QBD approaches for waiting times and sojourn times in discrete time queues, the dimension of the matrix blocks involved in the M/G/1 approach can be significantly smaller.     

A Spectral Method for a Nonpreemptive Priority BMAP/G/1 QUEUE

Abstract

In this paper we consider a nonpreemptive priority queue with two priority classes of customers. Customers arrive according to a batch Markovian arrival process (BMAP). In order to calculate the boundary vectors we propose a spectral method based on zeros of the determinant of a matrix function and the corresponding eigenvectors. It is proved that there are M zeros in a set Ω, where M is the size of the state space of the underlying Markov process. The zeros are calculated by the Durand-Kerner method, and the stationary joint probability of the numbers of customers of classes 1 and 2 at departures is derived by the inversion of the two-dimensional Fourier transform. For a numerical example, the stationary probability is calculated.     

Fast and Stable Algorithms for Computing and Sampling From the Noncentral Hypergeometric Distribution

Although the noncentral hypergeometric distribution underlies conditional inference for 2 × 2 tables, major statistical packages lack support for this distribution. This article introduces fast and stable algorithms for computing the noncentral hypergeometric distribution and for sampling from it. The algorithms avoid the expensive and explosive combinatorial numbers by using a recursive relation. The algorithms also take advantage of the sharp concentration of the distribution around its mode to save computing time. A modified inverse method substantially reduces the number of searches in generating a random deviate. The algorithms are implemented in a Java class, Hypergeometric, available on the World Wide Web.