On classification of signals represented with data-dependent overcomplete dictionaries
From MaRDI portal
Recommendations
- Data representations and generalization error in kernel based learning machines
- A learning generalization bound with an application to sparse-representation classifiers
- The sample complexity of dictionary learning
- A sparsity driven kernel machine based on minimizing a generalization error bound
- Dictionary Learning Algorithms for Sparse Representation
Cites work
- Data representations and generalization error in kernel based learning machines
- scientific article; zbMATH DE number 3176348 (Why is no real title available?)
- scientific article; zbMATH DE number 3528420 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 3304505 (Why is no real title available?)
- Matching pursuits with time-frequency dictionaries
- Selection of relevant features and examples in machine learning
- Ten Lectures on Wavelets
- Wavelets and filter banks
Cited in
(2)
This page was built for publication: On classification of signals represented with data-dependent overcomplete dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902412)