Abstract: To solve the problem that the original kmeans algorithm is sensitive to the clustering number k, an improved kmeans algorithm is proposed. The algorithm is designed to firstly calculate the similarity between word vectors based on the principle of cooccurrence words and divides the data into k+x clusters according to the similarity threshold and then uses kmeans algorithm for k+x clusters. The proposed algorithm is applied to the text clustering. The experimental results show that the proposed algorithm is more accurate than the original algorithm.

Key words: kmeans algorithm, cooccurrence word, word vector, similarity