基于动态嵌入的图聚类
Graph Clustering with Dynamic Embedding
摘要:
图聚类(或社区发现)在Web挖掘和信息网络领域的研究中一直受到广泛关注。最近关于这个主题的文献已经达成了共识,即节点内容和链接结构应该被集成以实现可靠的图聚类,特别是在无监督的设置中。然而,现有的方法基于浅模型往往遭受的内容噪声和稀疏。在这项工作中,我们建议利用深度嵌入进行图聚类,这是由于神经网络在学习内在内容表示方面的公认能力。在此基础上,我们通过影响力传播原理捕捉网络的动态本质,并计算动态网络嵌入。然后基于这种嵌入的稳态来检测网络簇。与大多数现有的任务不可知的嵌入方法不同,我们同时解决了底层节点表示和端到端的最佳聚类分配。为了提供更多的洞察力,我们从理论上分析了我们对网络集群的解释,并找到了它与两种广泛应用的网络建模方法的潜在联系。在六个真实世界的数据集上进行了大量的实验,包括社交网络和引文网络,实验结果证明了我们所提出的模型的优越性。
英文摘要:
Graph clustering (or community detection) has long drawn enormous attention from the research on web mining and information networks. Recent literature on this topic has reached a consensus that node contents and link structures should be integrated for reliable graph clustering, especially in an unsupervised setting. However, existing methods based on shallow models often suffer from content noise and sparsity. In this work, we propose to utilize deep embedding for graph clustering, motivated by the well-recognized power of neural networks in learning intrinsic content representations. Upon that, we capture the dynamic nature of networks through the principle of influence propagation and calculate the dynamic network embedding. Network clusters are then detected based on the stable state of such an embedding. Unlike most existing embedding methods that are task-agnostic, we simultaneously solve for the underlying node representations and the optimal clustering assignments in an end-to-end manner. To provide more insight, we theoretically analyze our interpretation of network clusters and find its underlying connections with two widely applied approaches for network modeling. Extensive experimental results on six real-world datasets including both social networks and citation networks demonstrate the superiority of our proposed model over the state-of-the-art.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。