Estimation of a distribution function bounded by two known distribution functions

The problem of estimation of a cumulative distribution function (cdf), bounded by two known cdf's, is considered. An estimator satisfying the desired restriction has been obtained by suitably adjusting the empirical cdf. Consistency of the adjusted estimator has been established and its mean square error (MSE) has been shown to be smallerthan that of the empirical cdf. The new estimator has been comparedwith the empirical cdf for some special cases.     

SEMIPARAMETRIC COMPARISON OF REGRESSION CURVES VIA NORMAL LIKELIHOODS

Härdle & Marron (1990) treated the problem of semiparametric comparison of nonparametric regression curves by proposing a kernel-based estimator derived by minimizing a version of weighted integrated squared error. The resulting estimators of unknown transformation parameters are n-consistent, which prompts a consideration of issues. of optimality. We show that when the unknown mean function is periodic, an optimal nonparametric estimator may be motivated by an elegantly simple argument based on maximum likelihood estimation in a parametric model with normal errors. Strikingly, the asymptotic variance of an optimal estimator of θ does not depend at all on the manner of estimating error variances, provided they are estimated n-consistently. The optimal kernel-based estimator derived via these considerations is asymptotically equivalent to a periodic version of that suggested by Härdle & Marron, and so the latter technique is in fact optimal in this sense. We discuss the implications of these conclusions for the aperiodic case.     

ESTIMATION OF A DISTRIBUTION FUNCTION DOMINATING STOCHASTICALLY A KNOWN DISTRIBUTION FUNCTION

This paper considers the problem of estimating a cumulative distribution function (cdf), when it is known a priori to dominate a known cdf. The estimator considered is obtained by adjusting the empirical cdf using the prior information. This adjusted estimator is shown to be consistent, its limiting distribution is found, and its mean squared error (MSE) is shown to be smaller than the MSE of the empirical cdf. Its asymptotic efficiency (compared to the empirical cdf) is also found.     

Estimation for the censored partially linear quantile regression models

In this article, we develop estimation procedures for partially linear quantile regression models, where some of the responses are censored by another random variable. The nonparametric function is estimated by basis function approximations. The estimation procedure is easy to implement through existing weighted quantile regression, and it requires no specification of the error distributions. We show the large-sample properties of the resulting estimates, the proposed estimator of the regression parameter is root-n consistent and asymptotically normal and the estimator of the functional component achieves the optimal convergence rate of the nonparametric function. The proposed method is studied via simulations and illustrated with the analysis of a primary biliary cirrhosis (BPC) data.     

A Generalization of Turnbull’s Estimator for Interval-Censored and Doubly Truncated Data

Nonparametric estimates of the conditional distribution of a response variable given a covariate are important for data exploration purposes. In this article, we propose a nonparametric estimator of the conditional distribution function in the case where the response variable is subject to interval censoring and double truncation. Using the approach of Dehghan and Duchesne (2011), the proposed method consists in adding weights that depend on the covariate value in the self-consistency equation of Turnbull (1976), which results in a nonparametric estimator. We demonstrate by simulation that the estimator, bootstrap variance estimation and bandwidth selection all perform well in finite samples.     

A semiparametric estimator of the distribution function of a variable measured with error

The estimation of the distribution functon of a random variable X measured with error is studied. Let the i-th observation on X be denoted by Y_iX_i+ε_i where ε_i is the measuremen error. Let {Y_i} (i=1,2,…,n) be a sample of independent observations. It is assumed that {X_i} and {∈_i} are mutually independent and each is identically distributed. As is standard in the literature for this problem, the distribution of e is assumed known in the development of the methodology. In practice, the measurement error distribution is estimated from replicate observations.

The proposed semiparametric estimator is derived by estimating the quantises of X on a set of n transformed V-values and smoothing the estimated quantiles using a spline function. The number of parameters of the spline function is determined by the data with a simple criterion, such as AIC. In a simulation study, the semiparametric estimator dominates an optimal kernel estimator and a normal mixture estimator for a wide class of densities.

The proposed estimator is applied to estimate the distribution function of the mean pH value in a field plot. The density function of the measurement error is estimated from repeated measurements of the pH values in a plot, and is treated as known for the estimation of the distribution function of the mean pH value.     

Nonparametric inference about service time distribution from indirect measurements

Summary.  In studies of properties of queues, for example in relation to Internet traffic, a subject that is of particular interest is the 'shape' of service time distribution. For example, we might wish to know whether the service time density is unimodal, suggesting that service time distribution is possibly homogeneous, or whether it is multimodal, indicating that there are two or more distinct customer populations. However, even in relatively controlled experiments we may not have access to explicit service time data. Our only information might be the durations of service time clusters, i.e. of busy periods. We wish to 'deconvolve' these concatenations, and to construct empirical approximations to the distribution and, particularly, the density function of service time. Explicit solutions of these problems will be suggested. In particular, a kernel-based 'deconvolution' estimator of service time density will be introduced, admitting conventional approaches to the choice of bandwidth.     

Application of Bernstein Polynomials for smooth estimation of a distribution and density function

The empirical distribution function is known to have optimum properties as an estimator of the underlying distribution function. However, it may not be appropriate for estimating continuous distributions because of its jump discontinuities. In this paper, we consider the application of Bernstein polynomials for approximating a bounded and continuous function and show that it can be naturally adapted for smooth estimation of a distribution function concentrated on the interval [0,1] by a continuous approximation of the empirical distribution function. The smoothness of the approximating polynomial is further used in deriving a smooth estimator of the corresponding density. The asymptotic properties of the resulting estimators are investigated. Specifically, we obtain strong consistency and asymptotic normality under appropriate choice of the degree of the polynomial. The case of distributions with other compact and non-compact support can be dealt through transformations. Thus, this paper gives a general method for non-parametric density estimation as an alternative to the current estimators. A small numerical investigation shows that the estimator proposed here may be preferable to the popular kernel-density estimator.     

Statistical inference on transformation models: a self-induced smoothing approach

This paper deals with a general class of transformation models that contains many important semiparametric regression models as special cases. It develops a self-induced smoothing for the maximum rank correlation estimator, resulting in simultaneous point and variance estimation. The self-induced smoothing does not require bandwidth selection, yet provides the right amount of smoothness so that the estimator is asymptotically normal with mean zero (unbiased) and variance–covariance matrix consistently estimated by the usual sandwich-type estimator. An iterative algorithm is given for the variance estimation and shown to numerically converge to a consistent limiting variance estimator. The approach is applied to a data set involving survival times of primary biliary cirrhosis patients. Simulation results are reported, showing that the new method performs well under a variety of scenarios.     

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.     

Estimation of Several Intraclass Correlation Coefficients

An intraclass correlation coefficient observed in several populations is estimated. The basis is a variance-stabilizing transformation. It is shown that the intraclass correlation coefficient from any elliptical distribution should be transformed in the same way. Four estimators are compared. An estimator where the components in a vector consisting of the transformed intraclass correlation coefficients are estimated separately, an estimator based on a weighted average of these components, a pretest estimator where the equality of the components is tested and then the outcome of the test is used in the estimation procedure, and a James-Stein estimator which shrinks toward the mean.     

Asymptotic normality of a weighted integrated squared error of kernel regression estimates with data-dependent bandwidth

Let (X, Y) be a bivariate random vector and let be the regression function of Y on X that has to be estimated from a sample of i.i.d. random vectors (X₁, Y₁),…,(X_n, Y_n) having the same distribution as (X, Y). In the present paper it is shown that the normalized integrated squared error of a kernel estimator with data-driven bandwidth is asymptotically normally distributed.     

Discrete associated kernels method and extensions

Discrete kernel estimation of a probability mass function (p.m.f.), often mentioned in the literature, has been far less investigated in comparison with continuous kernel estimation of a probability density function (p.d.f.). In this paper, we are concerned with a general methodology of discrete kernels for smoothing a p.m.f. f. We give a basic of mathematical tools for further investigations. First, we point out a generalizable notion of discrete associated kernel which is defined at each point of the support of f and built from any parametric discrete probability distribution. Then, some properties of the corresponding estimators are shown, in particular pointwise and global (asymptotical) properties. Other discrete kernels are constructed from usual discrete probability distributions such as Poisson, binomial and negative binomial. For small samples sizes, underdispersed discrete kernel estimators are more interesting than the empirical estimator; thus, an importance of discrete kernels is illustrated. The choice of smoothing bandwidth is classically investigated according to cross-validation and, novelly, to excess of zeros methods. Finally, a unification way of this method concerning the general probability function is discussed.     

Estimation of the error distribution in a varying coefficient regression model

This paper deals with the estimation of the error distribution function in a varying coefficient regression model. We propose two estimators and study their asymptotic properties by obtaining uniform stochastic expansions. The first estimator is a residual-based empirical distribution function. We study this estimator when the varying coefficients are estimated by under-smoothed local quadratic smoothers. Our second estimator which exploits the fact that the error distribution has mean zero is a weighted residual-based empirical distribution whose weights are chosen to achieve the mean zero property using empirical likelihood methods. The second estimator improves on the first estimator. Bootstrap confidence bands based on the two estimators are also discussed.     

Comments on estimators based on error in the predicted distribution function

In estimation of percentiles in the exponential distribution, the distribution function evaluated at the estimated percentile is often evaluated for purposes of warranty considerations. Optimal estimators are discussed and compared on their error in the predicted distribution function. Inconsistency is shown to exist between measures of closeness and measures of risk in the predicted distribution function. An optimal estimator based on absolute loss in the predicted distribution function is obtained and shown to be superior in measures of closeness to the optimal estimator, which minimizes squared error loss in the predicted distribution function.     

Adaptive wavelet estimation of a function from an m-dependent process with possibly unbounded m

The estimation of a multivariate function from a stationary m-dependent process is investigated, with a special focus on the case where m is large or unbounded. We develop an adaptive estimator based on wavelet methods. Under flexible assumptions on the nonparametric model, we prove the good performances of our estimator by determining sharp rates of convergence under two kinds of errors: the pointwise mean squared error and the mean integrated squared error. We illustrate our theoretical result by considering the multivariate density estimation problem, the derivatives density estimation problem, the density estimation problem in a GARCH-type model and the multivariate regression function estimation problem. The performance of proposed estimator has been shown by a numerical study for a simulated and real data sets.     

Root-n-consistent Estimation in Partial Linear Models with Long-memory Errors

We consider estimation of β in the semiparametric regression model y ( i ) - x ^T( i )β + f ( i / n ) + ε( i ) where x ( i ) = g ( i )/ n ) + e ( i , f and g are unknown smooth functions and the processes ε( i ) and e ( i ) are stationary with short- or long-range dependence. For the case of i.i.d. errors, Speckman (1988) proposed a √ n –consistent estimator of β. In this paper it is shown that, under suitable regularity conditions, this estimator is asymptotically unbiased and √ n –consistent even if the errors exhibit long-range dependence. The orders of the finite sample bias and of the required bandwidth depend on the long-memory parameters. Simulations and a data example illustrate the method     

Intensity Estimation for Spatial Point Processes Observed with Noise

Abstract.  This article introduces a kernel estimator of the intensity function of spatial point processes taking into account location errors. The asymptotic properties of the estimator are derived and a bandwidth selection procedure is described. A simulation study compares our results with that of the classical kernel estimator and shows that the edge-corrected deconvoluting kernel estimator is more appropriate.     

Adaptive smoothing in associated kernel discrete functions estimation using Bayesian approach

This paper demonstrates that cross-validation (CV) and Bayesian adaptive bandwidth selection can be applied in the estimation of associated kernel discrete functions. This idea is originally proposed by Brewer [A Bayesian model for local smoothing in kernel density estimation, Stat. Comput. 10 (2000), pp. 299–309] to derive variable bandwidths in adaptive kernel density estimation. Our approach considers the adaptive binomial kernel estimator and treats the variable bandwidths as parameters with beta prior distribution. The best variable bandwidth selector is estimated by the posterior mean in the Bayesian sense under squared error loss. Monte Carlo simulations are conducted to examine the performance of the proposed Bayesian adaptive approach in comparison with the performance of the Asymptotic mean integrated squared error estimator and CV technique for selecting a global (fixed) bandwidth proposed in Kokonendji and Senga Kiessé [Discrete associated kernels method and extensions, Stat. Methodol. 8 (2011), pp. 497–516]. The Bayesian adaptive bandwidth estimator performs better than the global bandwidth, in particular for small and moderate sample sizes.     

A comparison of estimators of the geographical relative risk function

The geographical relative risk function is a useful tool for investigating the spatial distribution of disease based on case and control data. The most common way of estimating this function is using the ratio of bivariate kernel density estimates constructed from the locations of cases and controls, respectively. An alternative is to use a local-linear (LL) estimator of the log-relative risk function. In both cases, the choice of bandwidth is critical. In this article, we examine the relative performance of the two estimation techniques using a variety of data-driven bandwidth selection methods, including likelihood cross-validation (CV), least-squares CV, rule-of-thumb reference methods, and a new approximate plug-in (PI) bandwidth for the LL estimator. Our analysis includes the comparison of asymptotic results; a simulation study; and application of the estimators on two real data sets. Our findings suggest that the density ratio method implemented with the least-squares CV bandwidth selector is generally best, with the LL estimator with PI bandwidth being competitive in applications with strong large-scale trends but much worse in situations with elliptical clusters.