期刊文献+

基于单词超团的文本聚类方法 被引量:1

Text Clustering Method Based on Word Hyperclique
下载PDF
导出
摘要 为优化文本聚类效果,提出一种基于单词超团理论的文本聚类方法。利用文档中单词的关联模式来评估文档间的相似度,将单词超团作为文档向量辅助信息,以图划分的方式进行聚类分析。对不同聚类方法的结果进行比较,证明基于单词超团的文本聚类方法能提高文本聚类的准确性。 In order to improve text clustering performance,this paper proposes a text clustering method based on word hyperclique.It evaluates document similarity with word relationship between documents,works with word hyperclique as assistance of the document's vector and uses a corresponding clustering algorithm by graph to partition the document sets.Experimental results validate the effectiveness of the algorithm for improving clustering performance.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第11期86-88,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60773050 U0935003)
关键词 文本聚类 单词超团 聚类模式 特征选择 text clustering word hyperclique clustering mode feature selection
  • 相关文献

参考文献6

  • 1刘志勇,耿新青.基于模糊聚类的文本挖掘算法[J].计算机工程,2009,35(5):44-45. 被引量:19
  • 2Qu Chao,Li Yong,Zhu Jun,et al.Term Weighting Evaluation in Bipartite Partitioning for Text Clustering[C] //Proc.of AIRS'08.Harbin,China:[s.n.] ,2008:393-400.
  • 3朱君,曲超,汤庸.利用单词超团的二分图文本聚类算法[J].电子科技大学学报,2008,37(3):439-442. 被引量:4
  • 4Xiong Hui,Tan Pangning,Kumar V.Hyperclique Pattern Discovery[J].Data Mining and Knowledge Discovery Journal,2006,13(2):219-242.
  • 5Qu Chao,Li Yong,Zhang Jie,et al.Selecting the Right Features for Bipartite-based Text Clustering[C] //Pros.of ADMA'08.Huangshan,China:[s.n.] ,2008:477-484.
  • 6Baeza-Yates R,Ribeironeto B.Modem Information Retrieval[M].Boston,USA:Addison Wesley,1999.

二级参考文献15

  • 1林建敏,谢康林.基于PAT-array和模糊聚类的文本聚类方法[J].计算机工程,2004,30(12):126-127. 被引量:6
  • 2袁军鹏,朱东华,李毅,李连宏,黄进.文本挖掘技术研究进展[J].计算机应用研究,2006,23(2):1-4. 被引量:57
  • 3Hung C, Wermter S, Smith R Hybrid Neural Document Clustering Using Guided Self-organization and Wordnet[J]. Intelligent Systems, 2004, 19(2): 68-77.
  • 4Wang Xizhao, Wang Yadong, Wang Lijuan. Improving Fuzzy Cmean Clustering Based on Feature-weight Learning[J]. Pattern Recognition Letters, 2004, 25(10): 1123-1132.
  • 5Leski J. Towards a Robust Fuzzy CLustering[J]. Fuzzy Sets and Systems, 2003, 137(2): 215-233.
  • 6Devillez A, Bellaudel E Lecolier G V. A Fuzzy Hybrid Hierarchical Clustering Method with a New Criterion Able to Find the Optimal Partition[J]. Fuzzy Sets and Systems, 2002, 128(1): 323-338.
  • 7HU Tian-ming, SAM Y S. Finding centroid clusterings with entropy-based criteria[J]. Knowledge and Information Systems, 2006,10(4): 505-514.
  • 8HU Tlan-ming, QU Chao, CHEW L T, et al. Preserving patterns in bipartite graph partitioning. Proc[C]//18th IEEE Int Conf Tools with Artificial Intelligence (ICTAI'06). Washington D C: IEEE Press, 2006: 489-496.
  • 9HU Tian-ming, XIONG Jin-zhi, ZHENG Geng-zhong. Similarity-based combination of multiple clusterings[J]. Int J Computational Intelligence and Applications, 2005, 5(3): 351-369.
  • 10XIONG Hui, TAN Pang-ning, VIPIn K. Hyperclique pattern discovery[J]. Data Mining and Knowledge Discovery Journal, 2006, 13(2): 219-242.

共引文献21

同被引文献6

  • 1Arya S, Mount D M, Netanyahu N S, et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. ACM, 1998;45(6) : 891-923.
  • 2Achtert E, Bohm C, Kroger P, et al. Skyline and similarity search: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. ACM SIGMOD International Conference on Management of Data,2006:515-526.
  • 3Karp R. Reducibility among combinatorial problems. Complexity of Computer Computations 1972.
  • 4Makino K, Uno T. New algorithms for enumerating all maximal cliques. Lecture Notes in Computer Science, 2004 ;3111 : 260-272.
  • 5孙吉贵,刘杰,赵连宇.聚类算法研究[J].软件学报,2008(1):48-61. 被引量:1069
  • 6魏小锐,袁瑞芬,曲超.0-1矩阵的比特存储类[J].东莞理工学院学报,2010,17(3):44-47. 被引量:1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部