Clustering is one of the most fundamental tools in data science and machine learning, and k-means clustering is one of the most common such methods. There is a variety of approximate algorithms for the k-means problem, but computing the globally optimal solution is in general NP-hard. In this paper we consider the k-means problem for instances with low dimensional data and formulate it as a structured concave assignment problem. This allows us to exploit the low dimensional structure and solve the problem to global optimality within reasonable time for large data sets with several clusters. The method builds on iteratively solving a small concave problem and a large linear programming problem. This gives a sequence of feasible solutions along with bounds which we show converges to zero optimality gap. The paper combines methods from global optimization theory to accelerate the procedure, and we provide numerical results on their performance.
MAP Clustering under the Gaussian Mixture Model via Mixed Integer Nonlinear Optimization
Department of Mathematics and Statistics, University of Massachusetts Amherst, USA(马萨诸塞大学阿默斯特分校数学与统计系,美国);Data Science Program, Worcester Polytechnic Institute, USA(伍斯特理工学院数据科学项目,美国);Data Science Program and Foisie Business School, Worcester Polytechnic Institute, USA(伍斯特理工学院数据科学项目和福西商学院,美国)
Modified K-means Algorithm with Local Optimality Guarantees
Department of Mathematical Informatics, The University of Tokyo, Tokyo, Japan(东京大学数学信息学系);Huawei Noah's Ark Lab, Montréal, Canada(华为诺亚实验室);Center for Advanced Intelligence Project, RIKEN, Tokyo, Japan(日本理化学研究所高级智能项目中心)