arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.00522cs.LGcs.AI
收藏

半监督约束聚类:深入综述、排序分类和未来研究方向

Semi-Supervised Constrained Clustering: An In-Depth Overview, Ranked Taxonomy and Future Research Directions

DaSCI Andalusian Institute(DaSCI安达卢西亚研究所);University of Granada(格拉纳达大学);Ghent University - imec(根特大学-imec);University of Jaén(哈恩大学)

Germán González-Almagro, Daniel Peralta, Eli De Poorter, José-Ramón Cano, Salvador García

摘要:

聚类是一种众所周知的无监督机器学习方法,能够自动对具有相似特征的离散实例集进行分组。约束聚类是对该过程的半监督扩展,当专家知识可用于指示可以利用的约束时,可以使用该过程。这种约束的著名例子是must-link(表示两个实例属于同一个组)和cannot-link(两个实例绝对不属于一起)。约束聚类的研究领域已经显着增长,多年来提出了各种各样的新算法和更先进的约束类型。然而,没有统一的概述,可以很容易地理解各种各样的可用方法,限制和基准。为了弥补这一点,本研究提出了详细的约束聚类的背景,并提供了一个新的排名分类的约束类型,可用于约束聚类。此外,重点介绍了实例级成对约束,并概述了其应用及其历史背景。最后,它提出了一个统计分析,涵盖307个约束聚类方法,根据它们的特点进行分类,并提供了一个排名分数,表明哪些方法最有潜力的基础上,他们的流行程度和验证质量。最后,基于此分析,潜在的陷阱和未来的研究方向。

英文摘要:

Clustering is a well-known unsupervised machine learning approach capable of automatically grouping discrete sets of instances with similar characteristics. Constrained clustering is a semi-supervised extension to this process that can be used when expert knowledge is available to indicate constraints that can be exploited. Well-known examples of such constraints are must-link (indicating that two instances belong to the same group) and cannot-link (two instances definitely do not belong together). The research area of constrained clustering has grown significantly over the years with a large variety of new algorithms and more advanced types of constraints being proposed. However, no unifying overview is available to easily understand the wide variety of available methods, constraints and benchmarks. To remedy this, this study presents in-detail the background of constrained clustering and provides a novel ranked taxonomy of the types of constraints that can be used in constrained clustering. In addition, it focuses on the instance-level pairwise constraints, and gives an overview of its applications and its historical context. Finally, it presents a statistical analysis covering 307 constrained clustering methods, categorizes them according to their features, and provides a ranking score indicating which methods have the most potential based on their popularity and validation quality. Finally, based upon this analysis, potential pitfalls and future research directions are provided.

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

↑