arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.14932stat.MEcs.LGstat.CO
收藏

带约束的K-means聚类的代数方法

An Algebraic Approach to Constrained K-means Clustering

The University of Tokyo(东京大学);The University of Osaka(大阪大学);RIKEN(理化学研究所);Shiga University(滋贺大学)

Hiroki Oohori, Kentaro Fukushima, Michio Yamamoto

AI总结:

针对带成对约束的K-means聚类存在的可行分配缺失或计算成本高的问题,提出用Gröbner基简化约束的代数方法,实验表明其在低计算成本下聚类质量相当或更优。

摘要:

聚类通常仅使用对象特征进行,不过对象间关系的额外信息可能可用,且可通过约束纳入。其中,成对约束要求两个对象属于同一聚类或不同聚类。K-means算法的若干扩展可适配此类约束,但它们有时无法找到可行分配,或产生高计算成本。受这些局限驱动,我们提出一种带成对约束的K-means聚类的代数方法。该算法在优化前用Gröbner基简化约束,提升聚类分配效率,还能在优化前检测约束集是否存在可行分配。与现有算法的对比实验显示,所提算法在更低计算成本下达到了相当或更优的聚类质量,尤其在约束和聚类数量较小时表现突出。

英文摘要:

Clustering is typically performed using only object features, although additional information about relationships between objects may be available and can be incorporated through constraints. Among these, pairwise constraints require two objects to belong to the same cluster or to different clusters. Several extensions of the k-means algorithm accommodate such constraints, but they sometimes fail to find a feasible assignment or incur high computational cost. Motivated by these limitations, we propose an algebraic approach to k-means clustering with pairwise constraints. The algorithm simplifies the constraints using Gröbner bases before optimization, improving the efficiency of cluster assignment. It can also detect whether the constraint set has a feasible assignment before optimization. Comparative experiments with existing algorithms showed that the proposed algorithm achieved comparable or better clustering quality at a lower computational cost, particularly when the numbers of constraints and clusters were small.

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

↑