arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.13644cs.LG
收藏

类内相异约束下的最小类聚类

Clustering to the Fewest Clusters Under Intra-Cluster Dissimilarity Constraints

University of Lyon(里昂大学);INSA Lyon(里昂国立应用科学学院);ISAE-ENSMA(国立高等航空航天学院-ENSMA);SRD(SRD(需结合上下文,此处可能为特定研究部门或机构))

Jennie Andersen, Brice Chardin, Mohamed Tribak

摘要:

本文介绍了等宽聚类问题,其中有效的分区必须满足簇内相异性约束。与大多数现有的聚类算法不同,等宽聚类既不依赖于密度,也不依赖于预定义数量的预期类,而是依赖于相异性阈值。它的主要目标是确保最终用其集群代表替换任何对象所引起的误差的上限。在这种约束下,我们主要关注最小化集群的数量,以及潜在的子目标。我们认为,等宽聚类是一个健全的聚类问题,并讨论其与其他优化问题,现有的和新的实现,以及近似策略的关系。我们审查和评估合适的聚类算法,以确定各种实际的解决方案之间的权衡这个聚类问题。

英文摘要:

This paper introduces the equiwide clustering problem, where valid partitions must satisfy intra-cluster dissimilarity constraints. Unlike most existing clustering algorithms, equiwide clustering relies neither on density nor on a predefined number of expected classes, but on a dissimilarity threshold. Its main goal is to ensure an upper bound on the error induced by ultimately replacing any object with its cluster representative. Under this constraint, we then primarily focus on minimizing the number of clusters, along with potential sub-objectives. We argue that equiwide clustering is a sound clustering problem, and discuss its relationship with other optimization problems, existing and novel implementations as well as approximation strategies. We review and evaluate suitable clustering algorithms to identify trade-offs between the various practical solutions for this clustering problem.

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

↑