作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (2): 213-214. doi: 10.3969/j.issn.1000-3428.2012.02.070

• 人工智能及识别技术 • 上一篇    下一篇

一种基于词共现的文档聚类算法

常 鹏 1a,1b,冯 楠 1a,马 辉 2   

  1. (1. 天津大学 a. 管理与经济学部;b. 信息与网络中心,天津 300072;2. 天津城市建设学院管理工程系,天津 300384)
  • 收稿日期:2011-07-05 出版日期:2012-01-20 发布日期:2012-01-20
  • 作者简介:常 鹏(1980-),男,助理研究员、博士,主研方向:文本挖掘;冯 楠、马 辉,讲师、博士
  • 基金资助:

    国家自然科学基金资助项目(70901054)

Document Clustering Algorithm Based on Word Co-occurrence

CHANG Peng 1a,1b, FENG Nan 1a, MA Hui 2   

  1. (1a. School of Management; 1b. Information and Network Center, Tianjin University, Tianjin 300072, China; 2. Department of Management Engineering, Tianjin Institute of Urban Construction, Tianjin 300384, China)
  • Received:2011-07-05 Online:2012-01-20 Published:2012-01-20

摘要: 为解决文本主题表达存在的信息缺失问题,提出一种基于词共现的文档聚类算法。利用文档集上的频繁共现词建立文档主题向量表示模型,将其应用于层次聚类算法中,并通过聚类熵寻找最优的层次划分,从而准确反映文档之间的主题相关关系。实验结果表明,该算法所获得的结果优于其他基于短语的文档层次聚类算法。

关键词: 文档聚类, 文档模型, 词共现, 文档相似度, 聚类增益

Abstract: This paper presents a document clustering algorithm based on word co-occurrence to solve the problem about information deletion of text subject expression. It uses the word co-occurrence of document set to establish the document theme vector presentation model, and applies to the hierarchical clustering algorithm, through the clustering entropy to find the best level partition, and accurately reflects the relationship between documents’ theme. Experimental results show that the algorithm results is better than other phrases document hierarchical clustering algorithm.

Key words: document clustering, document model, word co-occurrence, document similarity, clustering gain

中图分类号: