AM-GCN: Adaptive Multi-channel Graph Convolutional Networks

被引:381
作者
Wang, Xiao [1 ]
Zhu, Meiqi [1 ]
Bo, Deyu [1 ]
Cui, Peng [2 ]
Shi, Chuan [1 ]
Pei, Jian [3 ]
机构
[1] Beijing Univ Posts & Telecommun, Beijing, Peoples R China
[2] Tsinghua Univ, Beijing, Peoples R China
[3] Simon Fraser Univ, Burnaby, BC, Canada
来源
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING | 2020年
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会;
关键词
Graph Convolutional Networks; Network Representation Learning; Deep Learning;
D O I
10.1145/3394486.3403177
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph Convolutional Networks (GCNs) have gained great popularity in tackling various analytics tasks on graph and network data. However, some recent studies raise concerns about whether GCNs can optimally integrate node features and topological structures in a complex graph with rich information. In this paper, we first present an experimental investigation. Surprisingly, our experimental results clearly show that the capability of the state-of-the-art GCNs in fusing node features and topological structures is distant from optimal or even satisfactory. The weakness may severely hinder the capability of GCNs in some classification tasks, since GCNs may not be able to adaptively learn some deep correlation information between topological structures and node features. Can we remedy the weakness and design a new type of GCNs that can retain the advantages of the state-of-the-art GCNs and, at the same time, enhance the capability of fusing topological structures and node features substantially? We tackle the challenge and propose an adaptive multi-channel graph convolutional networks for semi-supervised classification (AM-GCN). The central idea is that we extract the specific and common embeddings from node features, topological structures, and their combinations simultaneously, and use the attention mechanism to learn adaptive importance weights of the embeddings. Our extensive experiments on benchmark data sets clearly show that AM-GCN extracts the most correlated information from both node features and topological structures substantially, and improves the classification accuracy with a clear margin.
引用
收藏
页码:1243 / 1253
页数:11
相关论文
共 38 条
  • [1] Abu-El-Haija Sami, 2019, ICML, P21
  • [2] [Anonymous], 2007, ICML
  • [3] Bojchevski A., 2018, INT C LEARN REPR, P1
  • [4] Bruna Joan, 2014, C TRACK P, P1
  • [5] Chami I, 2019, ADV NEUR IN, V32
  • [6] How Do the Open Source Communities Address Usability and UX Issues? An Exploratory Study
    Cheng, Jinghui
    Guo, Jin L. C.
    [J]. CHI 2018: EXTENDED ABSTRACTS OF THE 2018 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, 2018,
  • [7] Defferrard M, 2016, ADV NEUR IN, V29
  • [8] Graph Neural Networks for Social Recommendation
    Fan, Wenqi
    Ma, Yao
    Li, Qing
    He, Yuan
    Zhao, Eric
    Tang, Jiliang
    Yin, Dawei
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 417 - 426
  • [9] Conditional Random Field Enhanced Graph Convolutional Neural Networks
    Gao, Hongchang
    Pei, Jian
    Huang, Heng
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 276 - 284
  • [10] Gao HY, 2019, PR MACH LEARN RES, V97