【24h】

Research on Text Clustering Algorithm Based on K_means and SOM

机译:基于K_means和SOM的文本聚类算法研究

获取原文

摘要

Text clustering is one of the difficult and hot research fields in the internet search engine research. Combination the advantages of K-means clustering and Self-Organizing Model (SOM) techniques, a new text clustering algorithm is presented. Firstly, texts are preprocessed to satisfy succeed process. Then, the paper analyzes common K-means clustering algorithm and SOM algorithm and combines them to overcome efficiency of low stability of K-means algorithm which is very sensitive to the initial cluster center and the isolated point text. The experimental results indicate that the improved algorithm has a higher accuracy and has a better stability, compared with the original algorithm.
机译:文本聚类是互联网搜索引擎研究中困难而又热门的研究领域之一。结合K-means聚类和自组织模型(SOM)技术的优点,提出了一种新的文本聚类算法。首先,对文本进行预处理以满足成功的需要。然后,本文分析了常见的K-means聚类算法和SOM算法,并将它们结合起来,以克服对初始聚类中心和孤立点文本非常敏感的K-means算法稳定性低的问题。实验结果表明,与原始算法相比,改进算法具有更高的精度和更好的稳定性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号