Hybrid Low-Order and Higher-Order Graph Convolutional Networks

被引:8
|
作者
Lei, Fangyuan [1 ,2 ]
Liu, Xun [2 ]
Dai, Qingyun [1 ]
Ling, Bingo Wing-Kuen [3 ]
Zhao, Huimin [4 ]
Liu, Yan [2 ]
机构
[1] Guangdong Prov Key Lab Intellectual Property & Bi, Guangzhou 510665, Peoples R China
[2] Guangdong Polytech Normal Univ, Sch Elect & Informat, Guangzhou 510665, Guangdong, Peoples R China
[3] Guangdong Univ Technol, Sch Informat Engn, Guangzhou, Guangdong, Peoples R China
[4] Guangdong Polytech Normal Univ, Sch Comp Sci, Guangzhou 510665, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
36;
D O I
10.1155/2020/3283890
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
With the higher-order neighborhood information of a graph network, the accuracy of graph representation learning classification can be significantly improved. However, the current higher-order graph convolutional networks have a large number of parameters and high computational complexity. Therefore, we propose a hybrid lower-order and higher-order graph convolutional network (HLHG) learning model, which uses a weight sharing mechanism to reduce the number of network parameters. To reduce the computational complexity, we propose a novel information fusion pooling layer to combine the high-order and low-order neighborhood matrix information. We theoretically compare the computational complexity and the number of parameters of the proposed model with those of the other state-of-the-art models. Experimentally, we verify the proposed model on large-scale text network datasets using supervised learning and on citation network datasets using semisupervised learning. The experimental results show that the proposed model achieves higher classification accuracy with a small set of trainable weight parameters.
引用
收藏
页数:9
相关论文
共 50 条
  • [31] Higher-Order Masked Graph Neural Networks for Traffic Flow Prediction
    Yuan, Kaixin
    Liu, Jing
    Lou, Jian
    2022 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2022, : 1305 - 1310
  • [32] Higher-Order Explanations of Graph Neural Networks via Relevant Walks
    Schnake, Thomas
    Eberle, Oliver
    Lederer, Jonas
    Nakajima, Shinichi
    Schuett, Kristof T.
    Mueller, Klaus-Robert
    Montavon, Gregoire
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (11) : 7581 - 7596
  • [33] Higher-Order Intentionality and Higher-Order Acquaintance
    Benj Hellie
    Philosophical Studies, 2007, 134 : 289 - 324
  • [34] Higher-Order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes
    Huang, Yiming
    Zeng, Yujie
    Wu, Qiang
    Lu, Linyuan
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 11, 2024, : 12653 - 12661
  • [35] Higher-order intentionality and higher-order acquaintance
    Hellie, Benj
    PHILOSOPHICAL STUDIES, 2007, 134 (03) : 289 - 324
  • [36] Graph IRs for Impure Higher-Order Languages
    Bracevac, Oliver
    Wei, Guannan
    Jia, Songlin
    Abeysinghe, Supun
    Jiang, Yuxuan
    Bao, Yuyan
    Rompf, Tiark
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (OOPSLA):
  • [37] Higher-Order Graph Contrastive Learning for Recommendation
    Zheng, ZhenZhong
    Li, Jianxin
    Wu, Xiaoming
    Liu, Xiangzhi
    Pei, Lili
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT VI, DASFAA 2024, 2024, 14855 : 35 - 51
  • [38] The HyperKron Graph Model for higher-order features
    Eikmeier, Nicole
    Gleich, David F.
    Ramani, Arjun S.
    2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, : 941 - 946
  • [39] Higher-order port-graph rewriting
    Fernandez, Maribel
    Maulat, Sebastien
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (101): : 25 - 37
  • [40] EXTENDING THE GRAPH FORMALISM TO HIGHER-ORDER GATES
    Khesin A.
    Ren K.
    Quantum Information and Computation, 2023, 23 (13-14): : 1128 - 1141