Data representations and generalization error in kernel based learning machines
From MaRDI portal
Recommendations
- On classification of signals represented with data-dependent overcomplete dictionaries
- A learning generalization bound with an application to sparse-representation classifiers
- scientific article; zbMATH DE number 2033148
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- A sparsity driven kernel machine based on minimizing a generalization error bound
Cites work
- Atomic decomposition by basis pursuit
- Filter bank frame expansions with erasures
- scientific article; zbMATH DE number 48198 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 3304505 (Why is no real title available?)
- scientific article; zbMATH DE number 3337815 (Why is no real title available?)
- Matching pursuit: Adaptive representations of images and sounds
- Matching pursuits with time-frequency dictionaries
- Selection of relevant features and examples in machine learning
- Ten Lectures on Wavelets
Cited in
(5)- On classification of signals represented with data-dependent overcomplete dictionaries
- Sparse representation in Szegő kernels through reproducing kernel Hilbert space theory with applications
- scientific article; zbMATH DE number 1843054 (Why is no real title available?)
- Generalization performance of multi-category kernel machines
- A learning generalization bound with an application to sparse-representation classifiers
This page was built for publication: Data representations and generalization error in kernel based learning machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498650)