An Efficient kNN Algorithm 


Vol. 11,  No. 7, pp. 849-854, Dec.  2004
10.3745/KIPSTB.2004.11.7.849


PDF
  Abstract

This paper proposes an algorithm to enhance the execution time of kNN in the document classification. The proposed algorithm is to enhance the execution time by minimizing the computing cost of the similarity between two documents by using the list of pairs, while the conventional kNN uses the list of pairs. The list of pairs can be obtained by applying the matrix transposition to the list of pairs at the training phase of the document classification. This paper analyzed the proposed algorithm in the time complexity and compared it with the conventional kNN. And it compared the proposed algorithm with the conventional kNN by using reuters-21578 data experimentally. The experimental results show that the proposed algorithm outperforms kNN about 90% in terms of the execution time.

  Statistics
  Cite this article

[IEEE Style]

J. M. Lee, "An Efficient kNN Algorithm," The KIPS Transactions:PartB , vol. 11, no. 7, pp. 849-854, 2004. DOI: 10.3745/KIPSTB.2004.11.7.849.

[ACM Style]

Jae Moon Lee. 2004. An Efficient kNN Algorithm. The KIPS Transactions:PartB , 11, 7, (2004), 849-854. DOI: 10.3745/KIPSTB.2004.11.7.849.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals