A batch learning vector quantization algorithm for nearest neighbour classification

被引:11
作者
Bermejo, S [1 ]
Cabestany, J [1 ]
机构
[1] Univ Politecn Catalunya, Dept Elect Engn, ES-08034 Barcelona, Spain
关键词
Learning Vector Quantization; Newton's optimization; nearest neighbour classification; batch learning algorithms;
D O I
10.1023/A:1009634824627
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce a batch learning algorithm to design the set of prototypes of 1 nearest-neighbour classifiers. Like Kohonen's LVQ algorithms, this procedure tends to perform vector quantization over a probability density function that has zero points at Bayes borders. Although it differs significantly from their online counterparts since: (1) its statistical goal is clearer and better defined; and (2) it converges superlinearly due to its use of the very fast Newton's optimization method. Experiments results using artificial data confirm faster training time and better classification performance than Kohonen's LVQ algorithms.
引用
收藏
页码:173 / 184
页数:12
相关论文
共 8 条
[1]  
BOTTOU L., 1998, Online Algorithms and Stochastic Approximations
[2]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[3]  
Gersho A., 1992, VECTOR QUANTIZATION
[4]  
Hestenes M.R., 1980, CONJUGATE DIRECTION
[5]  
KOHONEN T, 1996, SELF ORG MAPS
[6]  
KOHONEN T, 1995, LVQ PAK LEARNING VEC
[7]  
LAVIGNA A, 1990, THESIS U MARYLAND
[8]  
Vapnik V., 1982, SPRINGER SERIES STAT