Binary k-nearest neighbor for text categorization

Purpose - With the ever-increasing volume of text data via the internet, it is important that documents are classified as manageable and easy to understand categories. This paper proposes the use of binary k-nearest neighbour (BKNN) for text categorization.Design methodology approach - The paper des...

Full description

Saved in:
Bibliographic Details
Published inOnline information review Vol. 29; no. 4; pp. 391 - 399
Main Author Tan, Songbo
Format Journal Article
LanguageEnglish
Published Bradford Emerald Group Publishing Limited 01.01.2005
Emerald
Subjects
Online AccessGet full text
ISSN1468-4527
1468-4535
DOI10.1108/14684520510617839

Cover

More Information
Summary:Purpose - With the ever-increasing volume of text data via the internet, it is important that documents are classified as manageable and easy to understand categories. This paper proposes the use of binary k-nearest neighbour (BKNN) for text categorization.Design methodology approach - The paper describes the traditional k-nearest neighbor (KNN) classifier, introduces BKNN and outlines experiemental results.Findings - The experimental results indicate that BKNN requires much less CPU time than KNN, without loss of classification performance.Originality value - The paper demonstrates how BKNN can be an efficient and effective algorithm for text categorization. Proposes the use of binary k-nearest neighbor (BKNN ) for text categorization.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1468-4527
1468-4535
DOI:10.1108/14684520510617839