Classification by nearness in complementary subspaces
From MaRDI portal
(Redirected from Publication:2444594)
Recommendations
- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
- Classification in general finite dimensional spaces with the \(k\)-nearest neighbor rule
- Consistency and convergence rate for nearest subspace classifier
- Nearest-neighbour classifiers in natural scene analysis
- Nearest neighbor classification in infinite dimension
- Learning with nearest neighbour classifiers
Cites work
- A novel and quick SVM-based multi-class classifier
- Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
- Classification using distances from samples to linear manifolds
- scientific article; zbMATH DE number 3974187 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1055986 (Why is no real title available?)
- Introducing locality and softness in subspace classification
- Nearest neighbor pattern classification
- Soft margins for AdaBoost
Cited in
(4)- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
- Classification using distances from samples to linear manifolds
- scientific article; zbMATH DE number 3960796 (Why is no real title available?)
- Consistency and convergence rate for nearest subspace classifier
This page was built for publication: Classification by nearness in complementary subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444594)
