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

Sibao Chen, Haixian Wang, Bin LuoICPR 2010 · OpenReview

Abstract

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.
BibTeX
@inproceedings{chen2010dynamic,
  author = {Sibao Chen and Haixian Wang and Bin Luo},
  title = {{On Dynamic Weighting of Data in Clustering with K-Alpha Means}},
  booktitle = {ICPR},
  year = {2010},
  url = {https://openreview.net/forum?id=mqhADEoIe-a},
}

Loading related content...

Figure