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

一个深度约束聚类框架

A Framework for Deep Constrained Clustering

University of California, Davis(加州大学戴维斯分校);Google Research(谷歌研究院)

Hongjing Zhang, Tianyang Zhan, Sugato Basu, Ian Davidson

摘要:

约束聚类领域已经被研究人员广泛探索,并被实践者使用。约束聚类公式存在于流行的算法中,如k-means,混合模型和谱聚类,但有几个局限性。深度学习的一个基本优势是它的灵活性,在这里,我们将探索一个用于约束聚类的深度学习框架,特别是探索它如何扩展约束聚类领域。我们表明,我们的框架不仅可以处理标准的一起/分开的约束(没有记录良好的负面影响报告)产生的标记的边信息,但更复杂的约束产生的新类型的边信息,如连续值和高层次的领域知识。此外,我们提出了一个有效的训练范式,通常适用于这四种类型的约束。我们验证了我们的方法的有效性,在图像和文本数据集上的实验结果。我们还研究了我们的框架的鲁棒性,当学习噪声约束,并显示我们的框架的不同组件如何有助于最终的性能。我们的源代码可以在$\href{https://github.com/blueocean92/deep_constrained_clustering}{\text{URL}}$上找到。

英文摘要:

The area of constrained clustering has been extensively explored by researchers and used by practitioners. Constrained clustering formulations exist for popular algorithms such as k-means, mixture models, and spectral clustering but have several limitations. A fundamental strength of deep learning is its flexibility, and here we explore a deep learning framework for constrained clustering and in particular explore how it can extend the field of constrained clustering. We show that our framework can not only handle standard together/apart constraints (without the well documented negative effects reported earlier) generated from labeled side information but more complex constraints generated from new types of side information such as continuous values and high-level domain knowledge. Furthermore, we propose an efficient training paradigm that is generally applicable to these four types of constraints. We validate the effectiveness of our approach by empirical results on both image and text datasets. We also study the robustness of our framework when learning with noisy constraints and show how different components of our framework contribute to the final performance. Our source code is available at $\href{https://github.com/blueocean92/deep_constrained_clustering}{\text{URL}}$.

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

↑