Research and Improvement Method Based on k-mean Clustering Algorithm


  •  Guohua Zhang    
  •  Kangting Zhao    
  •  Yi Li    

Abstract

In view of the sensitivity of the traditional mean algorithm to outliers and noise points, an improved mean algorithm is proposed in this paper, which is based on the density of the distribution of objects in space. In the measurement of density, the sensitivity of clustering effect to initial parameters is reduced. The improved algorithm can filter the "noise" data and discover the clustering of arbitrary shapes, which is obviously superior to the standard mean algorithm.


This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1913-8989
  • ISSN(Online): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

WJCI (2020): 0.439

Impact Factor 2020 (by WJCI): 0.247

Google Scholar Citations (March 2022): 6907

Google-based Impact Factor (2021): 0.68

h-index (December 2021): 37

i10-index (December 2021): 172

(Click Here to Learn More)

Contact