A Jump-Preserving Curve Regression Procedure Based on Bilateral Kernel Estimation
نویسندگان
چکیده
منابع مشابه
A Jump-Preserving Curve Fitting Procedure Based On Local Piecewise-Linear Kernel Estimation
It is known that the fitted regression function based on conventional local smoothing procedures is not statistically consistent at jump positions of the true regression function. In this article, a curve-fitting procedure based on local piecewise-linear kernel estimation is suggested. In a neighborhood of a given point, a piecewise-linear function with a possible jump at the given point is fit...
متن کاملBlind Deconvolution for Jump-Preserving Curve Estimation
In many applications, observed signals are contaminated by both random noise and blur. This paper proposes a blind deconvolution procedure for estimating a regression function with possible jumps preserved, by removing both noise and blur when recovering the signals. Our procedure is based on three local linear kernel estimates of the regression function, constructed from observations in a left...
متن کاملA jump-detecting procedure based on spline estimation
In a random-design nonparametric regression model, procedures for detecting jumps in the regression function via constant and linear spline estimation method are proposed based on the maximal differences of the spline estimators among neighbouring knots, the limiting distributions of which are obtained when the regression function is smooth. Simulation experiments provide strong evidence that c...
متن کاملOn Jump Detection in Regression Curves Using Local Polynomial Kernel Estimation
Regression analysis when the underlying regression function has jumps is a research problem with many applications. In practice, jumps often represent structure changes of a related process. Hence, it is important to detect them accurately from observed noisy data. In the literature, there are some jump detectors proposed, most of which are based on local constant or local linear kernel smoothi...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical and Application
سال: 2015
ISSN: 2325-2251,2325-226X
DOI: 10.12677/sa.2015.44037