Learning from non-identical sampling for classification
From MaRDI portal
Publication:541601
DOI10.1007/s10444-009-9123-xzbMath1213.68511OpenAlexW2059794459MaRDI QIDQ541601
Publication date: 7 June 2011
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-009-9123-x
reproducing kernel Hilbert spacebinary classificationexcess misclassification errornon-identical sampling
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (3)
An oracle inequality for regularized risk minimizers with strongly mixing observations ⋮ Classification with non-i.i.d. sampling ⋮ Optimal convergence rates of high order Parzen windows with unbounded sampling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model selection for regularized least-squares algorithm in learning theory
- Multi-kernel regularized classifiers
- Derivative reproducing properties for kernel methods in learning theory
- Fast rates for support vector machines using Gaussian kernels
- The covering number in learning theory
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Regularization networks and support vector machines
- Convergence analysis of online algorithms
- Learning theory estimates via integral operators and their approximations
- On early stopping in gradient descent learning
- Learning Theory
- Capacity of reproducing kernel spaces in learning theory
- ONLINE LEARNING WITH MARKOV SAMPLING
- Chaos control using least-squares support vector machines
- Shannon sampling and function reconstruction from point values
This page was built for publication: Learning from non-identical sampling for classification