Some finite-sample-size properties of rosenblatt density estimates

The results of a Monte Carlo study of the sensitivity of Rosenblatt density estimates to the scale factor are presented.     

A generalized reflection method of boundary correction in kernel density estimation

The kernel method of estimation of curves is now popular and widely used in statistical applications. Kernel estimators suffer from boundary effects, however, when the support of the function to be estimated has finite endpoints. Several solutions to this problem have already been proposed. Here the authors develop a new method of boundary correction for kernel density estimation. Their technique is a kind of generalized reflection involving transformed data. It generates a class of boundary corrected estimators having desirable properties such as local smoothness and nonnegativity. Simulations show that the proposed method performs quite well when compared with the existing methods for almost all shapes of densities. The authors present the theory behind this new methodology, and they determine the bias and variance of their estimators.     

FOURIER SERIES ESTIMATION FOR LENGTH BIASED DATA

This paper proposes and investigates Fourier series estimators for length biased data. Specifically, two Fourier series estimators are constructed and studied based on ideas of Jones (1991) and Bhattacharyya et al. (1988) in the case of kernel density estimation. Approximate expressions for mean squared errors and integrated mean squared errors are obtained and compared, and some simulated examples are investigated. The Fourier series estimator based on the proposal of Jones seems to have the more desirable properties of the two. The paper concludes with some comments that put this work in a wider context.     

On multivariate variable-kernel density estimates for time series

Let X₁ be a strictly stationary multiple time series with values in R^d and with a common density f. Let X₁,.,.,X_n, be n consecutive observations of X₁. Let k = k_n, be a sequence of positive integers, and let H_ni be the distance from X_i to its kth nearest neighbour among X_j, j i. The multivariate variable-kernel estimate f_n, of f is defined by where K is a given density. The complete convergence of f_n, to f on compact sets is established for time series satisfying a dependence condition (referred to as the strong mixing condition in the locally transitive sense) weaker than the strong mixing condition. Appropriate choices of k are explicitly given. The results apply to autoregressive processes and bilinear time-series models.     

Invalidity of average squared error criterion in density estimation

The average squared error has been suggested earlier as an appropriate estimate of the integrated squared error, but an example is given which shows their ratio can tend to infinity. The results of a Monte Carlo study are also presented which suggest the average squared error can seriously underestimate the errors inherent in even the simplest density estimations.     

Matrix density estimation

The accuracy of orthogonal series types of density estimators can be conveniently measured in terms of their Mean Integrated Squared Error, or MISE. Further reduction In MISE is achieved by introducing certain weighting factors into the estimators. In this paper we consider optimal weighting matrices, and the result is a new class of density estimators, the collection of matrix density estimators.     

A fourier integral density estimate: a Monte Carlo study

Davis (1977) proposed the use of a kernel density estimate which is the sample characteristic function integrated over (-A(n) , A(n)), where A(n) is chosen to minimize the mean integrated square error of the estimate. The scalar, A(n), is determined by the sample size and the population characteristic function. This paper investigates, in a Monte Carlo study, the mean integrated square error obtained under a procedure suggested by Davis (1977) for estimating A(n) when the population characteristic function is unknown.     

A relationship between generalized and integrated mean square errors

Generalised Mean squared error is a flexible measure of the adequancy of ? repression estimator. It allows specific characteristics of the regression model and its intended use to be In-corportated in the measure itself. Similarly, integrated mean squared error enables a researcher to stipulate particular regions of interest and wi ighting functions in the assessment of a prediction equation. The appeal of both measures is their ability to allow design or model characteristics to directly influence the evaluation of fitted regression models. In this note an e-quivalence of the two measures is established for correctly specified models.     

On boundary correction in kernel density estimation

It is well known now that kernel density estimators are not consistent when estimating a density near the finite end points of the support of the density to be estimated. This is due to boundary effects that occur in nonparametric curve estimation problems. A number of proposals have been made in the kernel density estimation context with some success. As of yet there appears to be no single dominating solution that corrects the boundary problem for all shapes of densities. In this paper, we propose a new general method of boundary correction for univariate kernel density estimation. The proposed method generates a class of boundary corrected estimators. They all possess desirable properties such as local adaptivity and non-negativity. In simulation, it is observed that the proposed method perform quite well when compared with other existing methods available in the literature for most shapes of densities, showing a very important robustness property of the method. The theory behind the new approach and the bias and variance of the proposed estimators are given. Results of a data analysis are also given.     

Orthogonal series density estimation for complex surveys

We propose an orthogonal series density estimator for complex surveys, where samples are neither independent nor identically distributed. The proposed estimator is proved to be design-unbiased and asymptotically design-consistent. The asymptotic normality is proved under both design and combined spaces. Two data driven estimators are proposed based on the proposed oracle estimator. We show the efficiency of the proposed estimators in simulation studies. A real survey data example is provided for an illustration.     

On the estimation of the marginal density of a moving average process

The authors present a new convolution‐type kernel estimator of the marginal density of an MA(1) process with general error distribution. They prove the √n; ‐consistency of the nonparametric estimator and give asymptotic expressions for the mean square and the integrated mean square error of some unobservable version of the estimator. An extension to MA(q) processes is presented in the case of the mean integrated square error. Finally, a simulation study shows the good practical behaviour of the estimator and the strong connection between the estimator and its unobservable version in terms of the choice of the bandwidth.     

Correction of Density Estimators that are not Densities

Abstract. Several old and new density estimators may have good theoretical performance, but are hampered by not being bona fide densities; they may be negative in certain regions or may not integrate to 1. One can therefore not simulate from them, for example. This paper develops general modification methods that turn any density estimator into one which is a bona fide density, and which is always better in performance under one set of conditions and arbitrarily close in performance under a complementary set of conditions. This improvement-for-free procedure can, in particular, be applied for higher-order kernel estimators, classes of modern h ⁴ bias kernel type estimators, superkernel estimators, the sinc kernel estimator, the k -NN estimator, orthogonal expansion estimators, and for various recently developed semi-parametric density estimators.     

Optimal kernels when estimating non-smooth densities

The derivation of new kernel functions for the kernel estimator of an unknown density function is given. These kernels are shown to be optimal in some sense when the underlying density f is continuous but its derivative f′ is not, and consequently a solu tion is presented for an unsolved problem which was stated by van Eeden (1985). Other attractive features of these kernels are also discussed and a number of graphs are listed.     

Local orthogonal polynomial expansion for density estimation

A local orthogonal polynomial expansion (LOrPE) of the empirical density function is proposed as a novel method to estimate the underlying density. The estimate is constructed by matching localised expectation values of orthogonal polynomials to the values observed in the sample. LOrPE is related to several existing methods, and generalises straightforwardly to multivariate settings. By manner of construction, it is similar to local likelihood density estimation (LLDE). In the limit of small bandwidths, LOrPE functions as kernel density estimation (KDE) with high-order (effective) kernels inherently free of boundary bias, a natural consequence of kernel reshaping to accommodate endpoints. Consistency and faster asymptotic convergence rates follow. In the limit of large bandwidths LOrPE is equivalent to orthogonal series density estimation (OSDE) with Legendre polynomials, thereby inheriting its consistency. We compare the performance of LOrPE to KDE, LLDE, and OSDE, in a number of simulation studies. In terms of mean integrated squared error, the results suggest that with a proper balance of the two tuning parameters, bandwidth and degree, LOrPE generally outperforms these competitors when estimating densities with sharply truncated supports.     

Efficiency of an adaptive estimator of a log-zero-poisson parameter

An estimator, λ is proposed for the parameter λ of the log-zero-Poisson distribution. While it is not a consistent estimator of λ in the usual statistical sense, it is shown to be quite close to the maximum likelihood estimates for many of the 35 sets of data on which it is tried. Since obtaining maximum likelihood estimates is extremely difficult for this and other contagious distributions, this estimate will act at least as an initial estimate in solving the likelihood equations iteratively. A lesson learned from this experience is that in the area of contagious distributions, variability is so large that attention should be focused directly on the mean squared error and not on consistency or unbiasedness, whether for small samples or for the asymptotic case. Sample sizes for some of the data considered in the paper are in hundreds. The fact that the estimator which is not a consistent estimator of λ is closer to the maximum likeli-hood estimator than the consistent moment estimator shows that the variability is large enough to not permit consistency to materialize even for such large sample sizes usually available in actual practice.     

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.     

Orthogonal series estimators and cross-validation

The use of cross-validation is considered in conjunction with orthogonal series estimators for a probability density function. We attempt to establish a data-based procedure which will select both the optimal choice of series, and the best trade-off between bias-squared and variance, i.e. series length. Although the expected value of the estimator looks promising, the rate of convergence is very slow. Simulations illustrate the theoretical results.     

A fortran implementation of univariate fourier series density estimation

A set of Fortran-77 subroutines is described which compute a nonparametric density estimator expressed as a Fourier series. In addition, a subroutine is given for the estimation of a cumulative distribution. Performance measures are given based on samples from a Weibull distribution. Due to small size and modest space demands, these subroutines are easily implemented on most small computers.     

Error reduction in density estimation under shape restrictions

For the problems of nonparametric estimation of nonincreasing and symmetric unimodal density functions with bounded supports we determine the projections of estimates onto the convex families of possible parent densities with respect to the weighted integrated squared error. We also describe the method of approximating the analogous projections onto the respective density classes satisfying some general moment conditions. The method of projections reduces the estimation errors for all possible values of observations of a given finite sample size in a uniformly optimal way and provides estimates sharing the properties of the parent densities.     

Minimax linear empirical bayes estimation of the binomial parameter

The minimax linear Empirical Bayes estimators for a binomial parameter are obtained, assuming some information about the moments of the prior. The form of these estimates is used to propose a criterion which may be helpful in determining whether Empirical Bayes estimation is Indicated for a given problem.