Consistency and convergence rate for nearest subspace classifier

DOI10.1093/imaiai/iaw006OpenAlexW2468629461MaRDI QIDQ4603717

Yi Wang

Publication date: 19 February 2018

Published in: Information and Inference (Search for Journal in Brave)

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

zbMATH Keywords

classificationrate of convergenceconsistencysupervised learningnearset subspace

Mathematics Subject Classification ID

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

Uses Software

• ElemStatLearn
• C4.5
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast rates for support vector machines using Gaussian kernels
• Consistent nonparametric regression. Discussion
• Support vector machines are universally consistent
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Support-vector networks
• Statistical performance of support vector machines
• On the consistency properties of linear and quadratic discriminant analyses
• Fast rate of convergence in high-dimensional linear discriminant analysis
• The rate of convergence of<tex>k_n</tex>-NN regression estimates and classification rules (Corresp.)
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• 10.1162/1532443041424319
• Rates of convergence of nearest neighbor estimation under arbitrary sampling
• Nearest neighbor pattern classification
• The Rotation of Eigenvectors by a Perturbation. III
• Convexity, Classification, and Risk Bounds
• The elements of statistical learning. Data mining, inference, and prediction

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