This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Centroid Ratio for a Pairwise Random Swap Clustering Algorithm
May 2014 (vol. 26 no. 5)
pp. 1-1
Pasi Franti, School of Computing, University of Eastern Finland, Joensuu, Finland
Qinpei Zhao, School of Software Engineering, Tongji University, Shanghai, China
Clustering algorithm and cluster validity are two highly correlated parts in cluster analysis. In this paper, a novel idea for cluster validity and a clustering algorithm based on the validity index are introduced. A Centroid Ratio is firstly introduced to compare two clustering results. This centroid ratio is then used in prototype-based clustering by introducing a Pairwise Random Swap clustering algorithm to avoid the local optimum problem of $k$ -means. The swap strategy in the algorithm alternates between simple perturbation to the solution and convergence toward the nearest optimum by $k$ -means. The centroid ratio is shown to be highly correlated to the mean square error (MSE) and other external indices. Moreover, it is fast and simple to calculate. An empirical study of several different datasets indicates that the proposed algorithm works more efficiently than Random Swap, Deterministic Random Swap, Repeated k-means or k-means++. The algorithm is successfully applied to document clustering and color image quantization as well.
Index Terms:
textual and multimedia data,Algorithms,Similarity measures,Quantization,Modeling structured
Citation:
Pasi Franti, Qinpei Zhao, "Centroid Ratio for a Pairwise Random Swap Clustering Algorithm," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 5, pp. 1-1, May 2014, doi:10.1109/TKDE.2013.113
Usage of this product signifies your acceptance of the Terms of Use.