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

J4 ›› 2013, Vol. 35 ›› Issue (7): 149-155.

• 论文 • Previous Articles     Next Articles

Combined algorithm of GAAC and
K-means for  Uyghur text clustering          

TURDI Tohti,AHMATJAN Ablat,MUYASSAR Aniwar,ASKAR Hamdulla   

  1. (School of Information Science and Engineering,Xinjiang University,Urumqi 830046,China)
  • Received:2012-04-27 Revised:2012-10-16 Online:2013-07-25 Published:2013-07-25

Abstract:

The paper introduced the K-means method and the GAAC clustering method and the impact of two feature extraction methods on Uyghur text representation and clustering efficiency. Based on the largescale text corpus, both the K-means method and the GAAC clustering method were used to carry out Uyghur text clustering experiments and do performance comparative analysis. In view of the shortcoming that the K-means method is over dependent on the initial cluster centers and instable as well as the high computational complexity of the GAAC method, this paper proposed a Uyghur text clustering algorithm combining the GAAC and the K-means methods. The proposed algorithm has two steps. Firstly, the optimal initial cluster center is obtained from the small amount of text set by the GAAC method. Secondly, the large amount of text set is fast clustered by the K-means method. Experimental results show that the proposed algorithm has a significant increase on the clustering accuracy and the time complexity.

Key words: Uyghur text;text clustering;Kmeans;GAAC;combined algorithm