General procedure for estimating the population mean using ranked set sampling

In this paper, we suggest a class of estimators for estimating the population mean ? of the study variable Y using information on X?, the population mean of the auxiliary variable X using ranked set sampling envisaged by McIntyre [A method of unbiased selective sampling using ranked sets, Aust. J. Agric. Res. 3 (1952), pp. 385–390] and developed by Takahasi and Wakimoto [On unbiased estimates of the population mean based on the sample stratified by means of ordering, Ann. Inst. Statist. Math. 20 (1968), pp. 1–31]. The estimator reported by Kadilar et al. [Ratio estimator for the population mean using ranked set sampling, Statist. Papers 50 (2009), pp. 301–309] is identified as a member of the proposed class of estimators. The bias and the mean-squared error (MSE) of the proposed class of estimators are obtained. An asymptotically optimum estimator in the class is identified with its MSE formulae. To judge the merits of the suggested class of estimators over others, an empirical study is carried out.     

On simple wavelet estimators of random signals and their small-sample properties

In the paper we suggest certain nonparametric estimators of random signals based on the wavelet transform. We consider stochastic signals embedded in white noise and extractions with wavelet denoizing algorithms utilizing the non-decimated discrete wavelet transform and the idea of wavelet scaling. We evaluate properties of these estimators via extensive computer simulations and partially also analytically. Our wavelet estimators of random signals have clear advantages over parametric maximum likelihood methods as far as computational issues are concerned, while at the same time they can compete with these methods in terms of precision of estimation in small samples. An illustrative example concerning smoothing of survey data is also provided.     

Simultaneous generation of multivariate mixed data with Poisson and normal marginals

The present paper develops a procedure for simulating multivariate data with count and continuous variables with a pre-specified correlation matrix. The count and continuous variables are assumed to have Poisson and normal marginals, respectively. The data generation mechanism is a combination of the normal to anything principle and a newly established connection between Poisson and normal correlations in the mixture. A step-by-step algorithm is provided and its performance is evaluated using two simulated and one real-data scenarios.     

Bootstrap-based unit root tests for higher order autoregressive models with GARCH(1, 1) errors

ABSTRACT

Bootstrap-based unit root tests are a viable alternative to asymptotic distribution-based procedures and, in some cases, are preferable because of the serious size distortions associated with the latter tests under certain situations. While several bootstrap-based unit root tests exist for autoregressive moving average processes with homoskedastic errors, only one such test is available when the innovations are conditionally heteroskedastic. The details for the exact implementation of this procedure are currently available only for the first order autoregressive processes. Monte-Carlo results are also published only for this limited case. In this paper we demonstrate how this procedure can be extended to higher order autoregressive processes through a transformed series used in augmented Dickey–Fuller unit root tests. We also investigate the finite sample properties for higher order processes through a Monte-Carlo study. Results show that the proposed tests have reasonable power and size properties.     

Estimation of random coefficient regression models

Linear regression models with coefficients across individual units regarded as random samples from some population are studied in this article from a Bayesian viewpoint. A prior distribution of the secondary parameters is derived following the Jeffreys rule. Posterior distribution of the primary and secondary parameters, and the predictive distribution of the future value are then examined. Computations of the parameter estimates are found to be rather straightforward. Data from a performance test on pigs is analysed and discussed. We also discuss the difficulties involved in using a Lindley and Smith (1972) prior in this problem.     

Simulations and computations of nonparametric density estimates for the deconvolution problem

The nonparametric density function estimation using sample observations which are contaminated with random noise is studied. The particular form of contamination under consideration is Y = X + Z, where Y is an observable random variableZ is a random noise variable with known distribution, and X is an absolutely continuous random variable which cannot be observed directly. The finite sample size performance of a strongly consistent estimator for the density function of the random variable X is illustrated for different distributions. The estimator uses Fourier and kernel function estimation techniques and allows the user to choose constants which relate to bandwidth windows and limits on integration and which greatly affect the appearance and properties of the estimates. Numerical techniques for computation of the estimated densities and for optimal selection of the constant are given.     

A stochastic graph process for epidemic modelling

A stochastic graph process with a Markov property is introduced to model the flow of an infectious disease over a known contact network. The model provides a probability distribution over unobserved infectious pathways. The basic reproductive number in compartmental models is generalized to a dynamic reproductive number based on the sequence of outdegrees in the graph process. The cumulative resistance and threat associated with each individual is also measured based on the cumulative indegree and outdegree of the graph process. The model is applied to the outbreak data from the 2001 foot‐and‐mouth (FMD) outbreak in the United Kingdom. The Canadian Journal of Statistics 40: 55–67; 2012 © 2012 Statistical Society of Canada     

A classification updating procedure motivated by high-content screening data

The current paradigm for the identification of candidate drugs within the pharmaceutical industry typically involves the use of high-throughput screens. High-content screening (HCS) is the term given to the process of using an imaging platform to screen large numbers of compounds for some desirable biological activity. Classification methods have important applications in HCS experiments, where they are used to predict which compounds have the potential to be developed into new drugs. In this paper, a new classification method is proposed for batches of compounds where the rule is updated sequentially using information from the classification of previous batches. This methodology accounts for the possibility that the training data are not a representative sample of the test data and that the underlying group distributions may change as new compounds are analysed. This technique is illustrated on an example data set using linear discriminant analysis, k-nearest neighbour and random forest classifiers. Random forests are shown to be superior to the other classifiers and are further improved by the additional updating algorithm in terms of an increase in the number of true positives as well as a decrease in the number of false positives.     

Convergence rates in the law of large numbers for END linear processes with random coefficients

Abstract

In this paper, we consider convergence rates in the Marcinkiewicz–Zygmund law of the large numbers for the END linear processes with random coefficients. We extend some results of Baum and Katz (1965 Baum, L. E., and M. Katz. 1965. Convergence rates in the law of large numbers. Transactions of the American Mathematical Society 120 (1):108–23. doi: 10.2307/1994170.[Crossref], [Web of Science ®] , [Google Scholar]) to the case of dependent linear processes with the random coefficients.