Skip to main navigation Skip to search Skip to main content

Improvement of K-means clustering algorithm based on MIP optimization

  • Beihang University

Research output: Contribution to journalConference articlepeer-review

Abstract

The k-means algorithm is a widely used partition clustering algorithm. The traditional k-means algorithm has two problems: it is easy to fall into the local optimal solution; it is very sensitive to the initial solution. In this paper, a k-means algorithm model based on mixed integer linear programming is established. The experiment shows that the effect of the new algorithm is better than the traditional k-means algorithm, and the above two problems are solved well.

Original languageEnglish
Article number012100
JournalJournal of Physics: Conference Series
Volume1053
Issue number1
DOIs
StatePublished - 26 Jul 2018
Event1st International Conference on Physics, Mathematics and Statistics, ICPMS 2018 - Shanghai, China
Duration: 12 May 201814 May 2018

Fingerprint

Dive into the research topics of 'Improvement of K-means clustering algorithm based on MIP optimization'. Together they form a unique fingerprint.

Cite this