The Community for Technology Leaders
RSS Icon
Subscribe
Lyon
Aug. 22, 2011 to Aug. 27, 2011
ISBN: 978-1-4577-1373-6
pp: 122-125
ABSTRACT
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
Miho Sakai, Takashi Onoda, "Independent Component Analysis Based Seeding Method for K-Means Clustering", WI-IAT, 2011, 2011 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies, 2011 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies 2011, pp. 122-125, doi:10.1109/WI-IAT.2011.29
3 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool