Deconvolution Estimation in Measurement Error Models: The R Package decon.

@article{Wang2011DeconvolutionEI,
  title={Deconvolution Estimation in Measurement Error Models: The R Package decon.},
  author={Xiao-Feng Wang and Bin Wang},
  journal={Journal of statistical software},
  year={2011},
  volume={39 10}
}
  • Xiao-Feng WangBin Wang
  • Published 1 March 2011
  • Mathematics
  • Journal of statistical software
Data from many scientific areas often come with measurement error. Density or distribution function estimation from contaminated data and nonparametric regression with errors-in-variables are two important topics in measurement error models. In this paper, we present a new software package decon for R, which contains a collection of functions that use the deconvolution kernel methods to deal with the measurement error problems. The functions allow the errors to be either homoscedastic or… 

The effects of error magnitude and bandwidth selection for deconvolution with unknown error distribution

A ridge-based kernel deconvolution estimator is proposed and its asymptotic properties are investigated depending on the error magnitude, and a data-driven bandwidth selection algorithm is presented by combining the bootstrap method and the idea of simulation extrapolation.

Nonparametric kernel methods for curve estimation and measurement errors

  • A. Delaigle
  • Mathematics, Computer Science
    Proceedings of the International Astronomical Union
  • 2014
Kernel methods are focused on, which are popular nonparametric techniques that can be used for both density and regression estimation, and can be directly applied to astronomical data, which is often measured with a certain degree of error.

Kernel deconvolution density estimation

We consider estimation of the density of a multivariate response, that is not observed directly but only through measurements contaminated by additive error. We focus on the realistic sampling case

Conditional density estimation in measurement error problems

Deconvolution density estimation with penalised MLE

Deconvolution is the important problem of estimating the distribution of a quantity of interest from a sample with additive measurement error. Nearly all methods in the literature are based on

Bayesian Semiparametric Density Deconvolution in the Presence of Conditionally Heteroscedastic Measurement Errors

This article introduces novel Bayesian semiparametric methodology based on Dirichlet process mixture models for robust deconvolution of densities in the presence of conditionally heteroscedastic measurement errors and shows that the models can adapt to asymmetry, heavy tails, and multimodality.

The Efficiency of Density Deconvolution

The density deconvolution problem involves recovering a target density g from a sample that has been corrupted by noise. From the perspective of Le Cam's local asymptotic normality theory, we show

Fast Nonparametric Maximum Likelihood Density Deconvolution Using Bernstein Polynomial

A new maximum approximate likelihood method for deconvoluting a continuous density on a finite interval in additive measurement error models with known error distribution using the approximate

Parametric deconvolution for a common heteroscedastic case

There exists an extensive statistics literature dealing with non-parametric deconvolution, the estimation of the underlying population probability density when sample values are subject to

Nonparametric Kernel Methods with Errors‐in‐Variables: Constructing Estimators, Computing them, and Avoiding Common Mistakes

Estimating a curve nonparametrically from data measured with error is a difficult problem that has been studied by many authors. Constructing a consistent estimator in this context can sometimes be
...

References

SHOWING 1-10 OF 30 REFERENCES

Data-driven deconvolution

In this paper we study an automatic empirical procedure for density deconvolution based on observations that are contaminated by additive measurement errors from a known distribution. The assumptions

On deconvolution with repeated measurements

In a large class of statistical inverse problems it is necessary to suppose that the transformation that is inverted is known. Although, in many applications, it is unrealistic to make this

Density Estimation in the Presence of Heteroscedastic Measurement Error

We consider density estimation when the variable of interest is subject to heteroscedastic measurement error. The density is assumed to have a smooth but unknown functional form that we model with a

Non‐parametric confidence bands in deconvolution density estimation

Summary.  Uniform confidence bands for densities f via non‐parametric kernel estimates were first constructed by Bickel and Rosenblatt. In this paper this is extended to confidence bands in the

Density Estimation for the Case of Supersmooth Measurement Error

Abstract The problem is to estimate the probability density of a random variable contaminated by an independent measurement error. I explore one of the worst-case scenario when the characteristic

Nonparametric Regression Estimation in the Heteroscedastic Errors-in-Variables Problem

In the classical errors-in-variables problem, the goal is to estimate a regression curve from data in which the explanatory variable is measured with error. In this context, nonparametric methods

Deconvolving kernel density estimators

This paper considers estimation of a continuous bounded probability density when observations from the density are contaminated by additive measurement errors having a known distribution. Properties

Bootstrap bandwidth selection in kernel density estimation from a contaminated sample

In this paper we consider kernel estimation of a density when the data are contaminated by random noise. More specifically we deal with the problem of how to choose the bandwidth parameter in

A Design-Adaptive Local Polynomial Estimator for the Errors-in-Variables Problem

This work proposes an innovative local polynomial estimator of any order in the errors-in-variables context, derive its design-adaptive asymptotic properties and study its finite sample performance on simulated examples.