arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2009.01674cs.LGcs.SIstat.ML
收藏

CAGNN:一种用于无监督图表示学习图神经网络

CAGNN: Cluster-Aware Graph Neural Networks for Unsupervised Graph Representation Learning

Center for Research on Intelligent Perception and Computing, Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所智能感知与计算研究中心);School of Artificial Intelligence, University of Chinese Academy of Sciences(中国科学院大学人工智能学院);School of Computer Science, Beijing University of Posts and Telecommunications(北京邮电大学计算机学院);Alibaba Group(阿里巴巴集团)

Yanqiao Zhu, Yichen Xu, Feng Yu, Shu Wu, Liang Wang

摘要:

无监督图表示学习的目标是在不受监督的情况下学习低维节点嵌入,同时保持图的拓扑结构和节点属性特征。以前的图神经网络(GNN)需要大量的标记节点,这些节点在现实世界的图数据中可能无法访问。在本文中,我们提出了一种新的聚类感知图神经网络(CAGNN)模型的无监督图表示学习使用自监督技术。在CAGNN中,我们对节点嵌入进行聚类,并通过预测聚类分配来更新模型参数。此外,我们观察到图通常包含类间边缘,这会误导GNN模型从邻域节点聚合噪声信息。我们通过加强类内边和减少基于聚类标签的不同类之间的节点连接来进一步细化图拓扑,从而更好地保留嵌入空间中的聚类结构。我们使用真实世界的数据集对两个基准任务进行了全面的实验。结果表明,该模型优于现有的基线方法的性能。值得注意的是,我们的模型在节点聚类的准确性方面比最先进的模型提高了7%以上。

英文摘要:

Unsupervised graph representation learning aims to learn low-dimensional node embeddings without supervision while preserving graph topological structures and node attributive features. Previous graph neural networks (GNN) require a large number of labeled nodes, which may not be accessible in real-world graph data. In this paper, we present a novel cluster-aware graph neural network (CAGNN) model for unsupervised graph representation learning using self-supervised techniques. In CAGNN, we perform clustering on the node embeddings and update the model parameters by predicting the cluster assignments. Moreover, we observe that graphs often contain inter-class edges, which mislead the GNN model to aggregate noisy information from neighborhood nodes. We further refine the graph topology by strengthening intra-class edges and reducing node connections between different classes based on cluster labels, which better preserves cluster structures in the embedding space. We conduct comprehensive experiments on two benchmark tasks using real-world datasets. The results demonstrate the superior performance of the proposed model over existing baseline methods. Notably, our model gains over 7% improvements in terms of accuracy on node clustering over state-of-the-arts.

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

↑