Pages that link to "Item:Q2005504"

The following pages link to Learning distance to subspace for the nearest subspace methods in high-dimensional data classification (Q2005504):

Displaying 7 items.

• On the orthogonal distance to class subspaces for high-dimensional data classification (Q778457) (← links)
• Minimum distance classification rules for high dimensional data (Q855920) (← links)
• Classification using distances from samples to linear manifolds (Q2444589) (← links)
• Classification by nearness in complementary subspaces (Q2444594) (← links)
• Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel (Q2660741) (← links)
• Consistency and convergence rate for nearest subspace classifier (Q4603717) (← links)
• A fast diagonal distance metric learning approach for large-scale datasets (Q6092062) (← links)