Abstract
We study learning algorithms for classification generated by regularization schemes in reproducing kernel Hilbert spaces associated with a general convex loss function in a non-i.i.d. process. Error analysis is studied and our main purpose is to provide an elaborate capacity dependent error bounds by applying concentration techniques involving the ℓ2-empirical covering numbers. © 2011 Elsevier Ltd.
| Original language | English |
|---|---|
| Pages (from-to) | 1347-1364 |
| Journal | Mathematical and Computer Modelling |
| Volume | 54 |
| Issue number | 5-6 |
| DOIs | |
| Publication status | Published - Sept 2011 |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Capacity dependent error bounds
- Learning theory
- Regularized classification
- Reproducing kernel Hilbert spaces
- β-mixing sequence
Fingerprint
Dive into the research topics of 'Classification with non-i.i.d. sampling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver