arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.05134cs.LG
收藏

神经容量聚类

Neural Capacitated Clustering

Institute of Computer Science, University of Hildesheim(希尔德斯海姆大学计算机科学研究所)

Jonas K. Falkner, Lars Schmidt-Thieme

AI总结:

本文提出Neural Capacited Clustering方法,通过神经网络预测分配概率并结合迭代k-means优化容量约束下的聚类,在人工与真实数据集及CVRP问题中表现优异。

摘要:

近期关于深度聚类的研究为约束聚类问题也找到了新的有前景的方法。其典型的成对约束通常可用于指导数据的划分。然而,许多问题具有聚类级别的约束,例如容量聚类问题(CCP),其中每个点都有一个权重,且每个聚类中所有点的总权重之和受限于预设的容量。在本文中,我们提出了一种针对CCP的新方法——Neural Capacited Clustering,该方法学习一个神经网络,从其他问题实例的最优或接近最优的历史解数据集中,预测点到聚类中心的分配概率。在推理阶段,生成的分数随后被用于类似迭代k-means的过程中,以在容量约束下优化分配。在我们对人工数据和两个真实世界数据集的实验中,我们的方法优于文献中几种最先进的数学和启发式求解器。此外,我们将该方法应用于容量车辆路径问题(CVRP)的先聚类后路径规划方法中,并在著名的Uchoa基准上展示了具有竞争力的结果。

英文摘要:

Recent work on deep clustering has found new promising methods also for constrained clustering problems. Their typically pairwise constraints often can be used to guide the partitioning of the data. Many problems however, feature cluster-level constraints, e.g. the Capacitated Clustering Problem (CCP), where each point has a weight and the total weight sum of all points in each cluster is bounded by a prescribed capacity. In this paper we propose a new method for the CCP, Neural Capacited Clustering, that learns a neural network to predict the assignment probabilities of points to cluster centers from a data set of optimal or near optimal past solutions of other problem instances. During inference, the resulting scores are then used in an iterative k-means like procedure to refine the assignment under capacity constraints. In our experiments on artificial data and two real world datasets our approach outperforms several state-of-the-art mathematical and heuristic solvers from the literature. Moreover, we apply our method in the context of a cluster-first-route-second approach to the Capacitated Vehicle Routing Problem (CVRP) and show competitive results on the well-known Uchoa benchmark.

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

↑