DocumentCode
3021428
Title
Study on the Improvement of K-Nearest-Neighbor Algorithm
Author
Sun Bo ; Du Junping ; Gao Tian
Author_Institution
Beijing Key Lab. of Intell. Telecommun. Software & Multimedia, Beijing Univ. of Posts & Telecommun., Beijing, China
Volume
4
fYear
2009
fDate
7-8 Nov. 2009
Firstpage
390
Lastpage
393
Abstract
As one of the instance based learning method, the K-nearest-neighbor (KNN) algorithm has been widely used in many fields. This paper accomplishes the improvements on the two aspects. First, aiming to improve the efficiency of classifying, we move some computations occurring at classifying period to the training period, which leads to the great descent of computational cost. Second, to improve the accuracy of classifying, we take into account of the contribution of different attributes and obtain the optimal attribute weight sets using the quadratic programming method. Finally, this paper gives the validation of the improvements through practical experiment.
Keywords
pattern classification; quadratic programming; set theory; K-nearest-neighbor algorithm; classification efficiency; computational cost; instance based learning method; optimal attribute weight sets; quadratic programming method; Artificial intelligence; Competitive intelligence; Computational and artificial intelligence; Computational efficiency; Computational intelligence; Databases; Learning systems; Quadratic programming; Software algorithms; Sun; K-nearest-neighbo; attribute weight sets); quadratic programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-3835-8
Electronic_ISBN
978-0-7695-3816-7
Type
conf
DOI
10.1109/AICI.2009.312
Filename
5376305
Link To Document