Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
From MaRDI portal
Publication:2005504
Recommendations
- On the orthogonal distance to class subspaces for high-dimensional data classification
- Classification by nearness in complementary subspaces
- Discriminant neighborhood embedding for classification
- Metric learning by discriminant neighborhood embedding
- Semi-supervised distance metric learning in high-dimensional spaces by using equivalence constraints
Cites work
- Distance metric learning for large margin nearest neighbor classification
- Incorporating prior probabilities into high-dimensional classifiers
- Median-based classifiers for high-dimensional data
- Nonparametric functional data analysis. Theory and practice.
- On selecting interacting features from high-dimensional data
- On the orthogonal distance to class subspaces for high-dimensional data classification
- Ordinal margin metric learning and its extension for cross-distribution image data
- Pattern recognition by means of disjoint principal components models
Cited in
(7)- Consistency and convergence rate for nearest subspace classifier
- On the orthogonal distance to class subspaces for high-dimensional data classification
- A fast diagonal distance metric learning approach for large-scale datasets
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Classification using distances from samples to linear manifolds
- Classification by nearness in complementary subspaces
- Minimum distance classification rules for high dimensional data
This page was built for publication: Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005504)
