k-NN classifiers: investigating the k = k (n) relationship

被引:1
作者
Alippi, C. [1 ]
Fuhrman, M. [2 ]
Roveri, M. [1 ]
机构
[1] Politecn Milan, Dipartimento Elettron & Informaz, I-20133 Milan, Italy
[2] Politecn Milan, Dipartimento Matemat, I-20133 Milan, Italy
来源
2008 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-8 | 2008年
关键词
D O I
10.1109/IJCNN.2008.4634324
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The paper proposes a theory-based method for estimating the optimal value of k in k-NN classifiers based on a n-sized training set. As expected, experiments show that the suggested k is such that k/n -> 0 when both k and n tend to infinity, as required by the asymptotical consistency condition. Interestingly, it appears that the generalization error is robust w.r.t. to k when n becomes large (probably as a consequence of the k/n -> 0 relationship); the immediate consequence is that there is no need to provide an accurate estimate for the optimal k and an approximated coarser value, eg., provided with cross validation, 1-fold cross validation or leave one out is more than adequate.
引用
收藏
页码:3676 / +
页数:2
相关论文
共 11 条
[1]  
ALIPPI C, 2008, K NN CLASSIFIERS INV
[2]  
ALIPPI C, 2007, NEUR NETW 2007 IJCNN, P1008
[3]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[4]  
Devroye L., 1996, A probabilistic theory of pattern recognition
[5]  
Fukunaga K., 1972, Introduction to statistical pattern recognition
[6]  
FUKUNAGA K, 1973, IEEE T INF THEORY, V19
[7]   On visualization and aggregation of nearest neighbor classifiers [J].
Ghosh, AK ;
Chaudhuri, P ;
Murthy, CA .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (10) :1592-1602
[8]  
KEANS M, 1999, NEURAL COMPUT, V11, P1427
[9]   ESTIMATION OF ERROR RATES IN DISCRIMINANT ANALYSIS [J].
LACHENBR.PA ;
MICKEY, MR .
TECHNOMETRICS, 1968, 10 (01) :1-&
[10]  
Mood A. M., 1963, INTRO THEORY STAT