High order Parzen windows and randomized sampling

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

10 Scopus Citations
View graph of relations

Author(s)

  • Xiang-Jun Zhou
  • Ding-Xuan Zhou

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)349-368
Journal / PublicationAdvances in Computational Mathematics
Volume31
Issue number4
Publication statusPublished - Oct 2009

Abstract

In this paper high order Parzen windows stated by means of basic window functions are studied for understanding some algorithms in learning theory and randomized sampling in multivariate approximation. Learning rates are derived for the least-square regression and density estimation on bounded domains under some decay conditions on the marginal distributions near the boundary. These rates can be almost optimal when the marginal distributions decay fast and the order of the Parzen windows is large enough. For randomized sampling in shift-invariant spaces, we consider the situation when the sampling points are neither i.i.d. nor regular, but are noised from regular grids by probability density functions. The approximation orders are estimated by means of the regularity of the approximated function and the density function and the order of the Parzen windows. © Springer Science+Business Media, LLC 2008.

Research Area(s)

  • Approximation, Basic window function, High order kernels, Parzen windows, Randomized sampling, Regression

Citation Format(s)

High order Parzen windows and randomized sampling. / Zhou, Xiang-Jun; Zhou, Ding-Xuan.
In: Advances in Computational Mathematics, Vol. 31, No. 4, 10.2009, p. 349-368.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review