文档相似矩阵在提高KNN分类效率中的应用  

Application of Document Similarity Matrix in the Improvement of Classification Efficiency of KNN Classification Algorithm

作　　者：路永和[1] 何新宇[1] 

机构地区：[1]中山大学资讯管理学院,广东广州510006

出　　处：《情报理论与实践》2014年第1期141-144,共4页Information Studies:Theory & Application

基　　金：国家高技术研究发展计划("863"计划)资助项目"农产品全供应链多源信息感知技术与产品开发"的成果;项目编号:2012AA101701

摘　　要：针对传统KNN分类算法在样本数量大、维度高的情况下相似度计算量大的问题,提出了基于相似矩阵的改进KNN分类算法。该算法通过计算样本两两之间的相似度,建立相似矩阵加速KNN算法中寻找K近邻;以搜狗自然语言实验室的文本分类语料库中的新闻文档作为实验对象,采用宏平均F测度值作为分类效果评价标准,用改进KNN方法和传统KNN方法进行对比实验。实验结果表明:通过调节参数,本方法能在不损失精度的情况下减少寻找K近邻时相似度计算的次数。In view of the fact that the traditional KNN classification algorithm has to calculate a large number of similarity problems when there is a large number of samples with high dimensions, this paper proposes an improved KNN classification algo- rithm based on the similarity matrix. The algorithm uses the similarity matrix established by calculating the similarity between 2 sam- pies to accelerate the search of K nearest neighbors in KNN algorithm; taking the news documents in the text classification corpus in Sogou Natural Language Laboratory as the experimental object, and using the macro-averaging F measuring value as the classifica- tion effect evaluation standard, the paper performs a comparative experiment with the improved KNN method and the traditional KNN method. The experimental results show that by adjusting the parameters, the proposed method can reduce the similarity calcu- lating times without the lass of accuracy when searching K nearest neighbors.

关 键 词：文本分类 K最近邻分类法 相似矩阵 算法 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]