This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology
Independent Component Analysis Based Seeding Method for K-Means Clustering
Lyon, France
August 22-August 27
ISBN: 978-0-7695-4513-4
The k-means clustering method is a widely used clustering technique for the Web because of its simplicity and speed. However, the clustering result depends heavily on the chosen initial clustering centers, which are chosen uniformly at random from the data points. We propose a seeding method based on the independent component analysis for the k-means clustering method. We evaluate the performance of our proposed method and compare it with other seeding methods by using benchmark datasets. We applied our proposed method to a Web corpus, which is provided by ODP. The experiments show that the normalized mutual information of our proposed method is better than the normalized mutual information of k-means clustering method and k-means++ clustering method. Therefore, the proposed method is useful for Web corpus.
Index Terms:
independent component analysis, seeding, k-means clustering
Citation:
Takashi Onoda, Miho Sakai, Seiji Yamada, "Independent Component Analysis Based Seeding Method for K-Means Clustering," wi-iat, vol. 3, pp.122-125, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology, 2011
Usage of this product signifies your acceptance of the Terms of Use.