On Dynamic Weighting of Data in Clustering with K-Alpha Means

Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a new class of clustering algorithm, K-Alpha Means (KAM), which is insensitive to the initial centers. With K-Harmonic Means as a special case, KAM dynamically weights data points during iteratively updating centers, which deemphasizes data points that are close to centers while emphasizes data points that are not close to any centers. Through replacing minimum operator in K-Means by alpha-mean operator, KAM significantly improves the clustering performances.

• Type: Journal
• Year: 2010
• Where: ICPR
• Authors: Sibao Chen, Haixian Wang, Bin Luo
• Keywords: Clustering Performances, Computer Vision, ICPR 2010, Initial Centers, K-means