Clustering by finding density peaks based on Chebyshev's inequality

  title={Clustering by finding density peaks based on Chebyshev's inequality},
  author={Ding Jiajun and Chen Zhongtian and He Xiongxiong and Zhan Yizhao},
  journal={2016 35th Chinese Control Conference (CCC)},
To detect the cluster centers automatically by fast clustering using density peak detection and overcome the disadvantage of original algorithm: selecting the centers by visual identifying, Chebyshev's inequality is applied. The new clustering algorithm by finding density peaks based on Chebyshev's inequality (CDP) can get the judgment index by screening density and distance which are normalized. The judgment index can reflect the attributes of the data because cluster centers' judgment indices… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.

Comparative Study on Projected Clustering Methods for Hyperspectral Imagery

  • M ODikshitA
  • Classi cation . Geocarto International,
  • 2015

Machine learning. Clustering by fast search and nd of density

  • Alex Rodriguez, L. Alessandro
  • peaks, Science,
  • 2014
2 Excerpts

Similar Papers

Loading similar papers…