arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.13595math.OCcs.LGstat.ML
收藏

一种全局求解低维k-means聚类问题的割平面算法

A cutting plane algorithm for globally solving low dimensional k-means clustering problems

KTH Royal Institute of Technology(瑞典皇家理工学院)

Martin Ryner, Jan Kronqvist, Johan Karlsson

AI总结:

本文将低维k-means聚类问题建模为结构化凹分配问题,提出一种基于割平面思想的全局优化算法,通过迭代求解小型凹问题和大型线性规划问题,实现大规模低维数据集的全局最优聚类。

摘要:

聚类是数据科学和机器学习中最基础的工具之一,而k-means聚类是最常用的此类方法之一。针对k-means问题存在多种近似算法,但计算全局最优解在一般情况下是NP难的。本文考虑低维数据实例的k-means问题,并将其形式化为一个结构化凹分配问题。这使我们能够利用低维结构,在合理时间内对具有多个簇的大型数据集求解至全局最优。该方法建立在迭代求解一个小型凹问题和一个大型线性规划问题的基础上。由此得到一系列可行解及其界,我们证明该序列收敛到零最优性间隙。本文结合全局优化理论中的方法来加速该过程,并提供了关于这些方法性能的数值结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑