arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.05970cs.LGstat.ML
收藏

逆图识别:给定图标签,我们能识别节点标签吗?

Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels?

Tsinghua University(清华大学);Tencent AI Lab(腾讯AI实验室)

Tian Bian, Xi Xiao, Tingyang Xu, Yu Rong, Wenbing Huang, Peilin Zhao, Junzhou Huang

摘要:

图识别(GI)在图学习中已经研究了很长时间,并且在某些应用中(例如,社交社区发现)是必不可少的。具体来说,GI需要预测给定其节点特征和边连接集合的目标图的标签/分数。虽然这个任务很常见,但在实践中会出现更复杂的情况-我们应该做相反的事情,例如,在给定不同社区的标签的情况下,将社交网络中的相似用户分组。这引发了一个有趣的想法:我们是否可以根据节点所属的图的标签来识别它们?因此,本文定义了一个新的问题,称为逆图识别(IGI),而不是GI。IGI的变体的正式讨论后,我们选择了一个特定的案例研究的节点聚类,通过使用的图形标签和节点功能,与一个层次图,进一步表征不同的图形之间的连接的援助。为了解决这个问题,我们提出了高斯混合图卷积网络(GMGCN),这是一种简单而有效的方法,在GI协议下使用图注意力网络(GAT)进行节点级消息传递过程,然后通过高斯混合层(GML)推断每个节点的类别。GMGCN的训练通过提出的共识损失来进一步提高,以利用分层图的结构。通过大量的实验验证了IGI公式的合理性。我们验证了所提出的方法相比,其他基线的几个基准,我们已经建立了优越性。我们将发布我们的代码和基准数据,以促进更多的研究关注IGI问题。

英文摘要:

Graph Identification (GI) has long been researched in graph learning and is essential in certain applications (e.g. social community detection). Specifically, GI requires to predict the label/score of a target graph given its collection of node features and edge connections. While this task is common, more complex cases arise in practice---we are supposed to do the inverse thing by, for example, grouping similar users in a social network given the labels of different communities. This triggers an interesting thought: can we identify nodes given the labels of the graphs they belong to? Therefore, this paper defines a novel problem dubbed Inverse Graph Identification (IGI), as opposed to GI. Upon a formal discussion of the variants of IGI, we choose a particular case study of node clustering by making use of the graph labels and node features, with an assistance of a hierarchical graph that further characterizes the connections between different graphs. To address this task, we propose Gaussian Mixture Graph Convolutional Network (GMGCN), a simple yet effective method that makes the node-level message passing process using Graph Attention Network (GAT) under the protocol of GI and then infers the category of each node via a Gaussian Mixture Layer (GML). The training of GMGCN is further boosted by a proposed consensus loss to take advantage of the structure of the hierarchical graph. Extensive experiments are conducted to test the rationality of the formulation of IGI. We verify the superiority of the proposed method compared to other baselines on several benchmarks we have built up. We will release our codes along with the benchmark data to facilitate more research attention to the IGI problem.

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

↑