CLASSIFICATION IN GENERAL FINITE DIMENSIONAL SPACES WITH THE k-NEAREST NEIGHBOR RULE
成果类型:
Article
署名作者:
Gadat, Sebastien; Klein, Thierry; Marteau, Clement
署名单位:
Universite de Toulouse; Universite Toulouse 1 Capitole; Toulouse School of Economics; Universite de Toulouse; Universite Toulouse III - Paul Sabatier; Centre National de la Recherche Scientifique (CNRS); Ecole Centrale de Lyon; Institut National des Sciences Appliquees de Lyon - INSA Lyon; Universite Claude Bernard Lyon 1; Universite Jean Monnet
刊物名称:
ANNALS OF STATISTICS
ISSN/ISSBN:
0090-5364
DOI:
10.1214/15-AOS1395
发表日期:
2016
页码:
982-1009
关键词:
DENSITY-ESTIMATION
CONVERGENCE
Consistency
rates
摘要:
Given an n-sample of random vectors (X-i, Y-i)(1 <= i <= n) whose joint law is unknown, the long-standing problem of supervised classification aims to optimally predict the label Y of a given new observation X. In this context, the k-nearest neighbor rule is a popular flexible and intuitive method in non parametric situations. Even if this algorithm is commonly used in the machine learning and statistics communities, less is known about its prediction ability in general finite dimensional spaces, especially when the support of the density of the observations is R-d. This paper is devoted to the study of the statistical properties of the k-nearest neighbor rule in various situations. In particular, attention is paid to the marginal law of X, as well as the smoothness and margin properties of the regression function eta(X) = E[Y vertical bar X]. We identify two necessary and sufficient conditions to obtain uniform consistency rates of classification and derive sharp estimates in the case of the k-nearest neighbor rule. Some numerical experiments are proposed at the end of the paper to help illustrate the discussion.
来源URL: