Robust nearest-neighbor methods for classifying high-dimensional data

DOI10.1214/08-AOS591zbMath1191.62113arXiv0909.0184MaRDI QIDQ1043737

Yao-ban Chan

Publication date: 9 December 2009

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.0184

zbMATH Keywords

thresholdfalse discovery ratehigher criticismdetection boundaryoptimal classificationclassification boundaryheterogeneous componentszero-one data

Mathematics Subject Classification ID

Nonparametric robustness (62G35) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (2)

Pattern recognition via projection-based \(k\)NN rules ⋮ On some transformations of high dimension, low sample size data for nearest neighbor classification

Cites Work

• Unnamed Item
• Nearest neighbor classification with dependent training sequences.
• Adaptive detection of a signal of growing dimension. I
• Adaptive detection of a signal of growing dimension. II
• Minimax detection of a signal for \(l^ n\)-balls.
• Higher criticism for detecting sparse heterogeneous mixtures.
• Theoretical Measures of Relative Performance of Classifiers for High Dimensional Data with Small Sample Sizes
• Distribution-free exponential error bound for nearest neighbor pattern classification
• On the finite sample performance of the nearest neighbor classifier
• Rates of convergence of nearest neighbor estimation under arbitrary sampling
• Large-Scale Simultaneous Hypothesis Testing
• Nearest neighbor pattern classification
• Convergence of the nearest neighbor rule

This page was built for publication: Robust nearest-neighbor methods for classifying high-dimensional data