Consistency and convergence rate for nearest subspace classifier

DOI10.1093/IMAIAI/IAW006MaRDI QIDQ4603717OpenAlexFDO

Authors Yi Wang

Publication date 19 February 2018

Published in Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imaiai/iaw006

zbMATH Keywords

supervised learningclassificationconsistencyrate of convergencenearset subspace

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Rate of convergence of \(k\)-nearest-neighbor classification rule
• Consistency and relative efficiency of subspace methods
• Learning distance to subspace for the nearest subspace methods in high-dimensional data classification
• Classification by nearness in complementary subspaces
• Consistency and convergence rates of one-class SVMs and related algorithms
• Convergence of subspace gradient method

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3870398 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 3314813 (Why is no real title available?)
• scientific article; zbMATH DE number 3074541 (Why is no real title available?)
• 10.1162/1532443041424319
• AdaBoost is consistent
• Consistency and convergence rates of one-class SVMs and related algorithms
• Consistent nonparametric regression. Discussion
• Convexity, Classification, and Risk Bounds
• Fast rate of convergence in high-dimensional linear discriminant analysis
• Fast rates for support vector machines using Gaussian kernels
• Nearest neighbor pattern classification
• On the consistency properties of linear and quadratic discriminant analyses
• Pattern recognition and machine learning.
• Rates of convergence of nearest neighbor estimation under arbitrary sampling
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Statistical performance of support vector machines
• Support vector machine soft margin classifiers: error analysis
• Support vector machines are universally consistent
• Support-vector networks
• The Rotation of Eigenvectors by a Perturbation. III
• The elements of statistical learning. Data mining, inference, and prediction
• The rate of convergence of<tex>k_n</tex>-NN regression estimates and classification rules (Corresp.)

Cited in

(1)

• Classification by nearness in complementary subspaces

Describes a project that uses

Uses Software

• ElemStatLearn
• C4.5
• PRMLT

This page was built for publication: Consistency and convergence rate for nearest subspace classifier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603717)