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

高阶属性增强的异构图神经网络

Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks

Beijing Advanced Innovation Center for Big Data and Brain Computing, Beihang University(北京航空航天大学大数据与脑机智能高精尖创新中心);University of Illinois at Chicago(伊利诺伊大学芝加哥分校);Yanshan University(燕山大学);Lehigh University(理海大学)

Jianxin Li, Hao Peng, Yuwei Cao, Yingtong Dou, Hekai Zhang, Philip S. Yu, Lifang He

摘要:

图神经网络(GNN)已广泛用于图上的深度学习。它们可以学习有效的节点表示,从而在节点分类和节点聚类等图形分析任务中实现卓越的性能。然而,大多数方法忽略了现实世界中的异质性图。另一方面,为异构图设计的方法无法学习复杂的语义表示,因为它们只使用元路径而不是元图。此外,它们不能完全捕获节点之间基于内容的相关性,因为它们要么不使用自注意机制,要么只使用它来考虑每个节点的直接邻居,忽略高阶邻居。我们提出了一种新的高阶属性增强(HAE)框架,以逐层的方式增强节点嵌入。在HAE框架下,我们提出了一个高阶属性增强图神经网络(HAEGNN)的异构网络表示学习。HAEGNN同时结合了丰富的,异构的语义元路径和元图,并利用自我注意机制,探索基于内容的节点交互。HAEGNN独特的高阶结构允许检查一阶和高阶邻域。此外,HAEGNN表现出良好的可解释性,因为它学习不同的元路径和元图的重要性。HAEGNN也是内存高效的,因为它避免了基于每个元路径的矩阵计算。实验结果表明,HAEGNN不仅在节点分类、节点聚类和可视化方面优于现有方法,而且在内存效率和可解释性方面也具有优势。

英文摘要:

Graph neural networks (GNNs) have been widely used in deep learning on graphs. They can learn effective node representations that achieve superior performances in graph analysis tasks such as node classification and node clustering. However, most methods ignore the heterogeneity in real-world graphs. Methods designed for heterogeneous graphs, on the other hand, fail to learn complex semantic representations because they only use meta-paths instead of meta-graphs. Furthermore, they cannot fully capture the content-based correlations between nodes, as they either do not use the self-attention mechanism or only use it to consider the immediate neighbors of each node, ignoring the higher-order neighbors. We propose a novel Higher-order Attribute-Enhancing (HAE) framework that enhances node embedding in a layer-by-layer manner. Under the HAE framework, we propose a Higher-order Attribute-Enhancing Graph Neural Network (HAEGNN) for heterogeneous network representation learning. HAEGNN simultaneously incorporates meta-paths and meta-graphs for rich, heterogeneous semantics, and leverages the self-attention mechanism to explore content-based nodes interactions. The unique higher-order architecture of HAEGNN allows examining the first-order as well as higher-order neighborhoods. Moreover, HAEGNN shows good explainability as it learns the importances of different meta-paths and meta-graphs. HAEGNN is also memory-efficient, for it avoids per meta-path based matrix calculation. Experimental results not only show HAEGNN superior performance against the state-of-the-art methods in node classification, node clustering, and visualization, but also demonstrate its superiorities in terms of memory efficiency and explainability.

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

↑