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

并行驱动的两两约束深度嵌入

Clustering-driven Deep Embedding with Pairwise Constraints

Tel-Aviv University(特拉维夫大学);Bar-Ilan University(巴伊兰大学)

Sharon Fogel, Hadar Averbuch-Elor, Jacov Goldberger, Daniel Cohen-Or

摘要:

最近,人们越来越关注利用神经网络的能力来分析数据。特别是,已经提出了采用深度嵌入的新聚类方法。在本文中,我们从基于质心的模型出发,提出了一个新的框架,称为基于成对约束的嵌入驱动深度嵌入(CPAC),用于使用神经网络的非参数聚类。我们提出了一个聚类驱动的嵌入基于暹罗网络,鼓励对数据点输出类似的表示在潜在的空间。我们的基于对的模型允许用标记对来增强信息,以构成半监督框架。我们的方法是基于分析与每对相关的损失,以完善的约束。我们表明,使用此方案时,即使用户查询数量有限,聚类性能也会提高。我们展示了我们的架构如何适应各种类型的数据,并提出了第一个深度框架来聚类3D形状。

英文摘要:

Recently, there has been increasing interest to leverage the competence of neural networks to analyze data. In particular, new clustering methods that employ deep embeddings have been presented. In this paper, we depart from centroid-based models and suggest a new framework, called Clustering-driven deep embedding with PAirwise Constraints (CPAC), for non-parametric clustering using a neural network. We present a clustering-driven embedding based on a Siamese network that encourages pairs of data points to output similar representations in the latent space. Our pair-based model allows augmenting the information with labeled pairs to constitute a semi-supervised framework. Our approach is based on analyzing the losses associated with each pair to refine the set of constraints. We show that clustering performance increases when using this scheme, even with a limited amount of user queries. We demonstrate how our architecture is adapted for various types of data and present the first deep framework to cluster 3D shapes.

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

↑