Semiparametric inference for open populations using the Jolly–Seber model: a penalized spline approach

When there are frequent capture occasions, both semiparametric and nonparametric estimators for the size of an open population have been proposed using kernel smoothing methods. While kernel smoothing methods are mathematically tractable, fitting them to data is computationally intensive. Here, we use smoothing splines in the form of P-splines to provide an alternate less computationally intensive method of fitting these models to capture–recapture data from open populations with frequent capture occasions. We fit the model to capture data collected over 64 occasions and model the population size as a function of time, seasonal effects and an environmental covariate. A small simulation study is also conducted to examine the performance of the estimators and their standard errors.     

Constructing an Accounting Journal Website

Abstract

To increase the effectiveness and efficiency of searches for information, accounting students, researchers, practitioners, and regulators could benefit from a Website devoted to the electronic access to journals. The site described here addresses such a need in the business discipline of accounting. On the site, the titles of over 470 journals are listed and categorized by topical areas within accounting. Then, within each accounting category, the journals are grouped according to their Internet accessibility. To provide the user with quick access to the various journals, the site provides links to the homepages of the various journals. Serials Review 2002; 28:201–205.     

On the Alias Method for Generating Random Variables from a Discrete Distribution

The alias method of Walker is a clever, new, fast method for generating random variables from an arbitrary, specified discrete distribution. A simple probabilistic proof is given, in terms of mixtures, that the method works for any discrete distribution with a finite number of outcomes. A more efficient version of the table-generating portion of the method is described. Finally, a brief discussion on efficiency of the method is given. We believe that the generality, speed, and simplicity of the method make it attractive for use in generating discrete random variables.     

k-POD: A Method for k-Means Clustering of Missing Data

The k-means algorithm is often used in clustering applications but its usage requires a complete data matrix. Missing data, however, are common in many applications. Mainstream approaches to clustering missing data reduce the missing data problem to a complete data formulation through either deletion or imputation but these solutions may incur significant costs. Our k-POD method presents a simple extension of k-means clustering for missing data that works even when the missingness mechanism is unknown, when external information is unavailable, and when there is significant missingness in the data.

[Received November 2014. Revised August 2015.]     

Sampling hyperparameters in hierarchical models: Improving on Gibbs for high-dimensional latent fields and large datasets

ABSTRACT

A common Bayesian hierarchical model is where high-dimensional observed data depend on high-dimensional latent variables that, in turn, depend on relatively few hyperparameters. When the full conditional distribution over latent variables has a known form, general MCMC sampling need only be performed on the low-dimensional marginal posterior distribution over hyperparameters. This improves on popular Gibbs sampling that computes over the full space. Sampling the marginal posterior over hyperparameters exhibits good scaling of compute cost with data size, particularly when that distribution depends on a low-dimensional sufficient statistic.     

Estimation for u-shaped beta distributions: minimum hellinger distance and related methods

We compare minimum Hellinger distance and minimum Heiiinger disparity estimates for U-shaped beta distributions. Given suitable density estimates, both methods are known to be asymptotically efficient when the data come from the assumed model family, and robust to small perturbations from the model family. Most implementations use kernel density estimates, which may not be appropriate for U-shaped distributions. We compare fixed binwidth histograms, percentile mesh histograms, and averaged shifted histograms. Minimum disparity estimates are less sensitive to the choice of density estimate than are minimum distance estimates, and the percentile mesh histogram gives the best results for both minimum distance and minimum disparity estimates. Minimum distance estimates are biased and a bias-corrected method is proposed. Minimum disparity estimates and bias-corrected minimum distance estimates are comparable to maximum likelihood estimates when the model holds, and give better results than either method of moments or maximum likelihood when the data are discretized or contaminated, Although our re¬sults are for the beta density, the implementations are easily modified for other U-shaped distributions such as the Dirkhlet or normal generated distribution.     

A generalized scheffé method of multiple comparisons

Standard resulrs on the extrema of quotients of quadratic forms are extended to the non-negative definite case. The maximum and the set over which it is achieved are characterized explicitly both in terms of generalized inverse matrices and generalized eigenvalues. These results become the basis of Scheffe type multiple comparisons in the usual way. To demonstrate their application to statistics with singular covariance matrices, the method is detailed for Mantel-Haenszel, Breslow, and Cox statistics. An example is presented illustrating a situation where the proposed Scheffe type comparisons may be better than the pairwise method.