On the orthogonal distance to class subspaces for high-dimensional data classification
From MaRDI portal
Recommendations
- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
- Minimum distance classification rules for high dimensional data
- Correlation and High-Dimensional Consistency in Pattern Recognition
- Estimation of misclassification probability for a distance-based classifier in high-dimensional data
- An estimator of misclassification probability for multi-class Euclidean distance classifier in high-dimensional data
Cites work
Cited in
(4)- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
- Extraction of category orthonormal subspace for multi-class classification
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- Minimum distance classification rules for high dimensional data
This page was built for publication: On the orthogonal distance to class subspaces for high-dimensional data classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778457)