Abstract
AbstractThe minimum sum-of-squares clusering is the most widely used clustering method. The minimum sum-of-squares clustering is usually solved by the heuristic KMEANS algorithm, which converges to a local optimum. A lot of effort has been made to solve such kind of problems, but a mixed integer linear programming formulation (MILP) is still missing. In this paper, we formulate MILP models. The advantage of MILP formulation is that users can extend the original problem with arbitrary linear constraints. We also present numerical results, we solve these models up to sample size of 150.
Funder
Corvinus University of Budapest
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference29 articles.
1. Ágoston KCs, E.-Nagy M (2021) Mixed integer linear programming formulation for K-means cluster problem. In: Drobne S, Stirn LZ, Kljajić BM, Povh J, Žerovnik J (eds) Proceedings of the 16th international symposium on operational research in Slovenia, pp 49–54
2. Aloise D, Deshpande A, Hansen P, Popat P (2009) NP-hardness of Euclidean sum-of-squares clustering. Mach Learn 75(2):245–248
3. Awasthi P, Bandeira AS, Charikar M, Krishnaswamy R, Villar S, Ward R (2015) Relax, no need to round: integrality of clustering formulations. In: ITCS ’15: proceedings of the 2015 conference on innovations in theoretical computer science, pp 191–200
4. Bradley PS, Bennett KP, Demiriz A (2000) Constrained K-means clustering. https://www.microsoft.com/en-us/research/publication/constrained-k-means-clustering/
5. Cornuejols G, Nemhauser GL, Wolsey LA (1980) A canonical representation of simple plant location-problems and its applications. SIAM J Algebr Discrete Methods 1:261–272
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献