首页> 外文会议>International Symposium on Computational Intelligence and Design >Study on Text Classification Algorithm Based on Non-negative Matrix Factorization
【24h】

Study on Text Classification Algorithm Based on Non-negative Matrix Factorization

机译:基于非负矩阵分解的文本分类算法研究

获取原文

摘要

In order to solve the high computational overhead and low classification efficiency of the KNN algorithm, a text feature vector representation method based on information gain and non-negative matrix factorization is proposed. The algorithm uses the information entropy and the semantic analysis method to realize the selection of the classification feature, which can reduce the number of text classification features, reducing the dimension of the text feature vector. Therefore, the overhead of similarity calculation between the text feature vectors is reduced. Accordingly, the classification efficiency of KNN algorithm is improved. The experimental results show that the proposed algorithm is feasible.
机译:为了解决KNN算法的高计算量和低分类效率,提出了一种基于信息增益和非负矩阵分解的文本特征向量表示方法。该算法利用信息熵和语义分析方法实现分类特征的选择,可以减少文本分类特征的数量,减小文本特征向量的维数。因此,减少了文本特征向量之间的相似度计算的开销。因此,提高了KNN算法的分类效率。实验结果表明,该算法是可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号