Abstract

Abstract In this paper, the effect of the initial clustering center selection on the performance of the K-means algorithm is studied, and the performance of the algorithm is enhanced through better initialization techniques. In the K-means clustering process, when calculating the density of a data set by using a weighted distance density calculation method, significant improvement in the defects of poor clustering results caused by the local optimum and large intra-cluster variance in the traditional K-means clustering algorithm has been found. Experimental results show that by using the improved method proposed in this paper, the intra-cluster variance of clustering results is reduced by 15.5% compared with the traditional method, which makes great improvement in the performance of the algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.