The Community for Technology Leaders
Green Image
Issue No. 05 - May (2014 vol. 26)
ISSN: 1041-4347
pp: 1090-1101
Qinpei Zhao , Sch. of Software Eng., Tongji Univ., Shanghai, China
Pasi Franti , Sch. of Comput., Univ. of Eastern Finland, Joensuu, Finland
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.
pattern clustering, data handling, image processing, mean square error methods,color image quantization, centroid ratio, pairwise random swap clustering algorithm, cluster analysis, validity index, prototype based clustering, swap strategy, mean square error, MSE, deterministic random swap, repeated k-means, document clustering,Clustering algorithms, Algorithm design and analysis, Time complexity, Partitioning algorithms, Indexes, Prototypes, Euclidean distance,textual and multimedia data, Algorithms, Similarity measures, Quantization, Modeling structured,$k$ -means, Data clustering, random/deterministic swap, clustering evaluation
Qinpei Zhao, Pasi Franti, "Centroid Ratio for a Pairwise Random Swap Clustering Algorithm", IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. , pp. 1090-1101, May 2014, doi:10.1109/TKDE.2013.113
238 ms
(Ver 3.3 (11022016))