• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science ›› 2010, Vol. 32 ›› Issue (5): 79-81.

Previous Articles     Next Articles

Text Clustering Algorithm with Ant Colony Based on the Best Solution Kept

LIU Xiaoyong   

  1. (1.National Science Library,Chinese Academy of Sciences,Beijing 100190;
    2.Department of Computer Science,Guangdong Polytechnic Normal University,Guangzhou 510665;
    3.Graduate School,Chinese Academy of Sciences,Beijing 100049,China)
  • Received:2009-11-15 Revised:2010-02-09 Online:2010-04-28 Published:2010-05-11
  • Contact: LIU Xiaoyong E-mail:liugucas@gmail.com

Abstract:

Clustering analysis with ant colony optimization (ACO) is presented by Deneubourg in 1991 and has been used widely. In this paper, a mechanism of the  best solution kept is presented to improve the performance of clustering analysis with ACO further. Two indices are chosen to valide the new algorithm. Two experiments in the datasetIris and the text dataset show that the new algorithm has better performance.

Key words: text clustering, ant colony algorithm, clustering with ACO, text mining

CLC Number: