Classification using distances from samples to linear manifolds
From MaRDI portal
Publication:2444589
DOI10.1007/S10044-011-0242-XzbMATH Open1284.68511OpenAlexW2014646448MaRDI QIDQ2444589FDOQ2444589
Authors: Yiguang Liu, Xiao-chun Cao, Jian-guo Liu 
Publication date: 10 April 2014
Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10044-011-0242-x
Recommendations
- Classification by nearness in complementary subspaces
- The Euclidean distance classifier: an alternative to the linear discriminant function
- Classification via local manifold approximation
- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
- Distance metric learning for large margin nearest neighbor classification
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Nearest neighbor pattern classification
- Title not available (Why is that?)
- Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
- Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
- Title not available (Why is that?)
- Classification of gene-expression data: the manifold-based metric learning way
- Title not available (Why is that?)
- A novel and quick SVM-based multi-class classifier
- Neighborhood size selection in the\( \)k-nearest-neighbor rule using statistical confidence
- On kernel difference-weighted \(k\)-nearest neighbor classification
Cited In (3)
Uses Software
This page was built for publication: Classification using distances from samples to linear manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444589)
