DocumentCode
2734235
Title
Classification with learning k-nearest neighbors
Author
Laaksonen, Jorma ; Oja, Erkki
Author_Institution
Lab. of Comput. & Inf. Sci., Helsinki Univ. of Technol., Espoo, Finland
Volume
3
fYear
1996
fDate
3-6 Jun 1996
Firstpage
1480
Abstract
The nearest neighbor (NN) classifiers, especially the k-NN algorithm, are among the simplest and yet most efficient classification rules and are widely used in practice. We introduce three adaptation rules that can be used in iterative training of a k-NN classifier. This is a novel approach both from the statistical pattern recognition and the supervised neural network learning points of view. The suggested learning rules resemble those of the well-known learning vector quantization (LVQ) method, but at the same time the classifier utilizes the fact that increasing the number of samples that the classification is based on leads to improved classification accuracy. The performances of the suggested learning rules are compared with the usual K-NN rules and the LVQ1 algorithm
Keywords
learning (artificial intelligence); neural nets; pattern classification; statistical analysis; vector quantisation; LVQ1 algorithm; adaptation rules; classification accuracy; classification rules; iterative training; k-NN algorithm; learning vector quantization; nearest neighbor classifiers; statistical pattern recognition; supervised neural network learning; Classification algorithms; Error analysis; Information science; Iterative algorithms; Laboratories; Nearest neighbor searches; Neural networks; Pattern recognition; Prototypes; Vector quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1996., IEEE International Conference on
Conference_Location
Washington, DC
Print_ISBN
0-7803-3210-5
Type
conf
DOI
10.1109/ICNN.1996.549118
Filename
549118
Link To Document