.png){kind=icon}
返回
An improved K-nearest-neighbor algorithm for text categorization
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2011.08.040.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Text categorization is a significant tool to manage and organize the surging text data. Many text categorization algorithms have been explored in previous literatures, such as KNN, Naive Bayes and Support Vector Machine. KNN text categorization is an effective but less efficient classification method. In this paper, we propose an improved KNN algorithm for text categorization, which builds the classification model by combining constrained one pass clustering algorithm and KNN text categorization. Empirical results on three benchmark corpora show that our algorithm can reduce the text similarity computation substantially and outperform the-state-of-the-art KNN, Naive Bayes and Support Vector Machine classifiers. In addition, the classification model constructed by the proposed algorithm can be updated incrementally, and it has great scalability in many real-word applications. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Text categorization
KNN text categorization
One-pass clustering
Spam filtering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
分享收藏分享收藏Preparation of water-dispersible TiO2 nanoparticles from titanium tetrachloride using urea hydrogen peroxide as an oxygen donor.png)
CrystEngComm
OAAI
CrystEngCommIF0
OAAI分享收藏
查看更多内容