Sparse distance metric learning
From MaRDI portal
Recommendations
- Distance metric learning for large margin nearest neighbor classification
- Sparse distance metric learning with \(L1\)-norm constraint for one-class samples in high-dimensional spaces and its application
- Metric learning: a survey
- Efficiently learning the metric with side-information
- Metric learning by discriminant neighborhood embedding
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- Distance metric learning for large margin nearest neighbor classification
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- On the conditions used to prove oracle results for the Lasso
- Random forests
- Simultaneous analysis of Lasso and Dantzig selector
- Statistics for high-dimensional data. Methods, theory and applications.
Cited in
(8)- Large margin nearest local mean classifier
- Distance metric learning for large margin nearest neighbor classification
- A nearest-neighbor search model for distance metric learning
- Sparse distance metric learning with \(L1\)-norm constraint for one-class samples in high-dimensional spaces and its application
- Sparse matrices in data analysis
- The kernel semi-least squares method for sparse distance approximation
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
- Sparse Sourcewise and Pairwise Distance Preservers
This page was built for publication: Sparse distance metric learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259733)
