Learning big (image) data via coresets for dictionaries
From MaRDI portal
Publication:2513397
Recommendations
- Optimal discriminative feature and dictionary learning for image set classification
- Learning Binary Hash Codes for Large-Scale Image Search
- Multi-Level Discriminative Dictionary Learning With Application to Large Scale Image Classification
- Learning Short Binary Codes for Large-scale Image Retrieval
- Large-Margin Learning of Compact Binary Image Encodings
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A PTAS for k-means clustering based on weak coresets
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Algorithms for facility location problems with outliers. (Extended abstract)
- Approximating extent measures of points.
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Decomposable searching problems I. Static-to-dynamic transformation
- Dictionary Learning Algorithms for Sparse Representation
- Drag forces and heat transfer coefficients for spherical, cuboidal and ellipsoidal particles in cross flow at sub-critical Reynolds numbers
- scientific article; zbMATH DE number 410386 (Why is no real title available?)
- scientific article; zbMATH DE number 5764828 (Why is no real title available?)
- scientific article; zbMATH DE number 5506202 (Why is no real title available?)
- scientific article; zbMATH DE number 1194132 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 1445318 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- Improved bounds on the sample complexity of learning
- On coresets for k-means and k-median clustering
- Private coresets
- Shape classification and analysis. Theory and practice.
- Smaller coresets for k-median and k-means clustering
- StreamKM++, a clustering algorithm for data streams
- Structural risk minimization over data-dependent hierarchies
- Subgradient and sampling algorithms for _1 regression
- The sample complexity of dictionary learning
- Universal \({\epsilon}\)-approximators for integrals
Cited in
(4)
This page was built for publication: Learning big (image) data via coresets for dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513397)