首页 | 本学科首页   官方微博 | 高级检索  
     

基于K-Means的文本层次聚类算法研究
引用本文:尉景辉,何丕廉,孙越恒.基于K-Means的文本层次聚类算法研究[J].计算机应用,2005,25(10):2323-2324.
作者姓名:尉景辉  何丕廉  孙越恒
作者单位:天津大学,电子信息工程学院,天津,300072;天津大学,电子信息工程学院,天津,300072;天津大学,电子信息工程学院,天津,300072
摘    要:提出了一种基于K-Means的文本层次聚类算法。它结合凝聚层次聚类和K Means算法的特点,减少凝聚层次法在凝聚过程中的错误,提高了聚类质量。实验结果表明,该算法的聚类质量优于层次聚类法。

关 键 词:文本聚类  向量空间模型  K-Means算法  层次聚类
文章编号:1001-9081(2005)10-2323-02
收稿时间:2005-04-19
修稿时间:2005-04-192005-06-26

Research on text hierarchical clustering algorithm based on K-Means
YU Jing-hui,HE Pi-lian,SUN Yue-heng.Research on text hierarchical clustering algorithm based on K-Means[J].journal of Computer Applications,2005,25(10):2323-2324.
Authors:YU Jing-hui  HE Pi-lian  SUN Yue-heng
Affiliation:School of Electronic Information Engineering,Tianjin University,Tianjin 300072,China
Abstract:A new text hierarchical clustering algorithm based on K-Means was presented, which combined features from both K-Means and agglomerative approach that allowed them to reduce the early-stage errors made by agglomerative method and hence improved the quality of clustering solutions. The experimental evaluation shows that, our algorithm leads to better solutions than agglomerative methods.
Keywords:text clustering  vector space model  K-Means  hierarchical clustering
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号