Faster and more robust point symmetry-based K-means algorithm

作者:

Highlights:

摘要

Based on the recently published point symmetry distance (PSD) measure, this paper presents a novel PSD measure, namely symmetry similarity level (SSL) operator for K-means algorithm. Our proposed modified point symmetry-based K-means (MPSK) algorithm is more robust than the previous PSK algorithm by Su and Chou. Not only the proposed MPSK algorithm is suitable for the symmetrical intra-clusters as the PSK algorithm does, the proposed MPSK algorithm is also suitable for the symmetrical inter-clusters. In addition, two speedup strategies are presented to reduce the time required in the proposed MPSK algorithm. Experimental results demonstrate the significant execution-time improvement and the extension to the symmetrical inter-clusters of the proposed MPSK algorithm when compared to the previous PSK algorithm.

论文关键词:Clustering,Inter-cluster,Intra-cluster,K-means algorithm,Point symmetry,Robustness,Speedup

论文评审过程:Received 6 August 2004, Revised 20 May 2005, Accepted 21 September 2005, Available online 28 December 2005.

论文官网地址:https://doi.org/10.1016/j.patcog.2005.09.015