Adaptive soft k-nearest-neighbour classifiers

被引:38
作者
Bermejo, S [1 ]
Cabestany, J [1 ]
机构
[1] Univ Politecn Catalunya, Dept Elect Engn, ES-08034 Barcelona, Spain
关键词
soft nearest-neighbour classifiers; online gradient descent; hand-written character recognition;
D O I
10.1016/S0031-3203(99)00186-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A novel classifier is introduced to overcome the limitations of the k-NN classification systems. It estimates the posterior class probabilities using a local Parzen window estimation with the k-nearest-neighbour prototypes (in the Euclidean sense) to the pattern to classify. A learning algorithm is also presented to reduce the number of data paints to store. Experimental results in two hand-written classification problems demonstrate the potential of the proposed classification system. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:1999 / 2005
页数:7
相关论文
共 11 条
[1]  
Benveniste A, 1990, Adaptive algorithms and stochastic approximations
[2]  
Bishop C. M., 1995, NEURAL NETWORKS PATT
[3]   LOCAL LEARNING ALGORITHMS [J].
BOTTOU, L ;
VAPNIK, V .
NEURAL COMPUTATION, 1992, 4 (06) :888-900
[4]  
BOTTOU L, 1996, ONLINE LEARNING STOC
[5]  
Darasay B., 1991, NEAREST NEIGHBOR PAT
[6]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[7]  
Garris M. D., 1997, NIST FORM BASED HAND
[8]   CONDENSED NEAREST NEIGHBOR RULE [J].
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (03) :515-+
[9]  
KOHONEN T, 1996, SELF ORG MAPS
[10]  
KOHONEN T, 1995, LVQ PAK LEARNING VEC