The K⁃means algorithm is widely known for its simplicity and fastness in text clustering. However, the selection of the initial clustering center with the traditional K⁃means algorithm is some random, and therefore, the fluctuations and instability of the clustering results are strongly affected by the initial clustering center. This paper proposed an algorithm to select the initial clustering center to eliminate the uncertainty of central point selection. The experiment results show that the improved K⁃means clustering algorithm is superior to the traditional algorithm.
clustering; K⁃means algorithm; initial clustering center