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

使用测量传播的深度聚类

Deep Clustering with Measure Propagation

Interactions LLC(Interactions 有限责任公司)

Minhua Chen, Badrinath Jayakumar, Padmasundari Gopalakrishnan, Qiming Huang, Michael Johnston, Patrick Haffner

摘要:

深度模型改进了监督学习和无监督学习的最新技术。例如,深度嵌入式聚类(DEC)通过使用堆叠式自动编码器进行表示学习,极大地提高了无监督聚类的性能。然而,深度建模的一个弱点是原始空间中的局部邻域结构不一定保留在潜在空间中。为了保持局部几何形状,在监督和半监督学习文献中已经提出了各种方法(例如,谱聚类和标签传播)。在本文中,我们将深度表示学习的强度与测量传播(MP)相结合,MP是一种最初用于半监督场景的基于KL发散的图正则化方法。MP的主要假设是,如果两个数据点在原始空间中接近,则它们可能属于同一类,通过类成员分布的KL-散度来衡量。通过在无监督学习场景中采取相同的假设,我们提出了我们的深度嵌入式聚类辅助测量传播(DECAMP)模型。我们在短文本聚类任务上评估了DECAMP。在三个公共数据集上,DECAMP的表现与其他最先进的基线具有竞争力,包括使用额外数据生成聚类过程中使用的词嵌入的基线。例如,在Stackoverflow数据集上,DECAMP实现了79%的聚类准确率,比所有现有基线高出约5%。这些实验结果表明,DECAMP是一种非常有效的无监督学习方法。

英文摘要:

Deep models have improved state-of-the-art for both supervised and unsupervised learning. For example, deep embedded clustering (DEC) has greatly improved the unsupervised clustering performance, by using stacked autoencoders for representation learning. However, one weakness of deep modeling is that the local neighborhood structure in the original space is not necessarily preserved in the latent space. To preserve local geometry, various methods have been proposed in the supervised and semi-supervised learning literature (e.g., spectral clustering and label propagation) using graph Laplacian regularization. In this paper, we combine the strength of deep representation learning with measure propagation (MP), a KL-divergence based graph regularization method originally used in the semi-supervised scenario. The main assumption of MP is that if two data points are close in the original space, they are likely to belong to the same class, measured by KL-divergence of class membership distribution. By taking the same assumption in the unsupervised learning scenario, we propose our Deep Embedded Clustering Aided by Measure Propagation (DECAMP) model. We evaluate DECAMP on short text clustering tasks. On three public datasets, DECAMP performs competitively with other state-of-the-art baselines, including baselines using additional data to generate word embeddings used in the clustering process. As an example, on the Stackoverflow dataset, DECAMP achieved a clustering accuracy of 79%, which is about 5% higher than all existing baselines. These empirical results suggest that DECAMP is a very effective method for unsupervised learning.

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

↑