Please use this identifier to cite or link to this item:
Title: An adaptive k-nearest neighbor text categorization strategy
Authors: Li, B
Lu, Q 
Yu, S
Issue Date: 2004
Source: ACM transactions on Asian language information processing, 2004, v. 3, no. 4, p. 215-226
Abstract: k is the most important parameter in a text categorization system based on the k-nearest neighbor algorithm (kNN). To classify a new document, the k-nearest documents in the training set are determined first. The prediction of categories for this document can then be made according to the category distribution among the k nearest neighbors. Generally speaking, the class distribution in a training set is not even; some classes may have more samples than others. The system's performance is very sensitive to the choice of the parameter k. And it is very likely that a fixed k value will result in a bias for large categories, and will not make full use of the information in the training set. To deal with these problems, an improved kNN strategy, in which different numbers of nearest neighbors for different categories are used instead of a fixed number across all categories, is proposed in this article. More samples (nearest neighbors) will be used to decide whether a test document should be classified in a category that has more samples in the training set. The numbers of nearest neighbors selected for different categories are adaptive to their sample size in the training set. Experiments on two different datasets show that our methods are less sensitive to the parameter k than the traditional ones, and can properly classify documents belonging to smaller classes with a large k. The strategy is especially applicable and promising for cases where estimating the parameter k via cross-validation is not possible and the class distribution of a training set is skewed.
Keywords: K-nearest neighbor algorithm
Machine learning
Text categorization
Text classification
Journal: ACM Transactions on Asian Language Information Processing 
ISSN: 1530-0226
DOI: 10.1145/1039621.1039623
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 7, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 21, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.