An Improved kNN Algorithm based on Essential Vector

Authors

  • Weidong Zhao Fudan University
  • Shuanglin Tang Fudan University
  • Weihui Dai Fudan University

DOI:

https://doi.org/10.5755/j01.eee.123.7.2389

Abstract

There are some limitations in traditional k-nearest neighbor (kNN) algorithm, one of which is the low efficiency in classification applications with high dimension and large training data. In this paper, an improved kNN algorithm EV-kNN is proposed to reduce the computation complexity by cutting off the number of training samples. It firstly gets k classes by the kNN calculation with the essential vector, then assigns corresponding category using the kNN again. Experimental results show that the improved algorithm can perform better than several other improved algorithms. Ill. 3, bibl. 10, tabl. 1 (in English; abstracts in English and Lithuanian).

DOI: http://dx.doi.org/10.5755/j01.eee.123.7.2389

Downloads

Published

2012-09-04

How to Cite

Zhao, W., Tang, S., & Dai, W. (2012). An Improved kNN Algorithm based on Essential Vector. Elektronika Ir Elektrotechnika, 123(7), 119-122. https://doi.org/10.5755/j01.eee.123.7.2389

Issue

Section

SYSTEM ENGINEERING, COMPUTER TECHNOLOGY