An Improved kNN Algorithm based on Essential Vector
AbstractThere 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).
How to Cite
The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.
By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.