Optimization of Initial Centroids for K-Means Algorithm Based on Small World Network - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Optimization of Initial Centroids for K-Means Algorithm Based on Small World Network

(1) , (1)
1

Abstract

K-means algorithm is a relatively simple and fast gather clustering algorithm. However, the initial clustering center of the traditional k-means algorithm was generated randomly from the dataset, and the clustering result was unstable. In this paper, we propose a novel method to optimize the selection of initial centroids for k-means algorithm based on the small world network. This paper firstly models a text document set as a network which has small world phenomenon and then use small-world’s characteristics to form k initial centroids. Experimental evaluation on documents croups show clustering results (total cohesion, purity, recall) obtained by proposed method comparable with traditional k-means algorithm. The experiments show that results are obtained by the proposed algorithm can be relatively stability and efficiency. Therefore, this method can be considered as an effective application in the domain of text documents, especially in using text clustering for topic detection.
Fichier principal
Vignette du fichier
978-3-642-32891-6_13_Chapter.pdf (299.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01524955 , version 1 (19-05-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Shimo Shen, Zuqiang Meng. Optimization of Initial Centroids for K-Means Algorithm Based on Small World Network. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.87-96, ⟨10.1007/978-3-642-32891-6_13⟩. ⟨hal-01524955⟩
480 View
260 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More