A Fast Randomized Clustering Method Based on a Hypothetical Potential Field

摘要

A novel randomized clustering method is proposed to overcome some of the drawbacks of Mean Shift method. A hypothetical potential field is constructed from all the data points. Different from Mean Shift which moves the kernel window towards high-density region, our method moves the kernel window towards low-potential region. The proposed method is evaluated by comparing with both Mean Shift and K-means++ on three synthetic data sets which represent the clusters of different sizes, different shapes and different distributions. The experiments show that our method can produce more accurate results than both Mean Shift and K-means++.