Learning Backtrackless Aligned-Spatial Graph Convolutional Networks for Graph Classification

被引:63
作者
Bai, Lu [1 ]
Cui, Lixin [2 ]
Jiao, Yuhang [1 ]
Rossi, Luca [3 ]
Hancock, Edwin R. [4 ]
机构
[1] Cent Univ Finance & Econ, Beijing 100081, Peoples R China
[2] Cent Univ Finance & Econ, Sch Informat, Beijing 100081, Peoples R China
[3] Queen Mary Univ London, London E1 4NS, England
[4] Univ York, Dept Comp Sci, York YO10 5DD, N Yorkshire, England
基金
中国国家自然科学基金;
关键词
Convolution; Adaptation models; Transforms; Convolutional neural networks; Standards; Feature extraction; Kernel; Graph convolutional networks; transitive vertex alignment; backtrackless walk;
D O I
10.1109/TPAMI.2020.3011866
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we develop a novel backtrackless aligned-spatial graph convolutional network (BASGCN) model to learn effective features for graph classification. Our idea is to transform arbitrary-sized graphs into fixed-sized backtrackless aligned grid structures and define a new spatial graph convolution operation associated with the grid structures. We show that the proposed BASGCN model not only reduces the problems of information loss and imprecise information representation arising in existing spatially-based graph convolutional network (GCN) models, but also bridges the theoretical gap between traditional convolutional neural network (CNN) models and spatially-based GCN models. Furthermore, the proposed BASGCN model can both adaptively discriminate the importance between specified vertices during the convolution process and reduce the notorious tottering problem of existing spatially-based GCNs related to the Weisfeiler-Lehman algorithm, explaining the effectiveness of the proposed model. Experiments on standard graph datasets demonstrate the effectiveness of the proposed model.
引用
收藏
页码:783 / 798
页数:16
相关论文
共 52 条
[1]  
[Anonymous], 2007, 2007 IEEE C COMPUTER
[2]  
[Anonymous], 2016, GEN CONVOLUTION OPER
[3]  
Atwood J, 2016, ADV NEUR IN, V29
[4]   Local-global nested graph kernels using nested complexity traces [J].
Bai, Lu ;
Cui, Lixin ;
Rossi, Luca ;
Xu, Lixiang ;
Bai, Xiao ;
Hancock, Edwin .
PATTERN RECOGNITION LETTERS, 2020, 134 :87-95
[5]   A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs [J].
Bai, Lu ;
Rossi, Luca ;
Cui, Lixin ;
Cheng, Jian ;
Hancock, Edwin R. .
IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (03) :1264-1277
[6]  
Bai L, 2015, PR MACH LEARN RES, V37, P30
[7]   Depth-based hypergraph complexity traces from directed line graphs [J].
Bai, Lu ;
Escolano, Francisco ;
Hancock, Edwin R. .
PATTERN RECOGNITION, 2016, 54 :229-240
[8]   Depth-based complexity traces of graphs [J].
Bai, Lu ;
Hancock, Edwin R. .
PATTERN RECOGNITION, 2014, 47 (03) :1172-1186
[9]   Shortest-path kernels on graphs [J].
Borgwardt, KM ;
Kriegel, HP .
Fifth IEEE International Conference on Data Mining, Proceedings, 2005, :74-81
[10]   Graph convolutional network with structure pooling and joint-wise channel attention for action recognition [J].
Chen, Yuxin ;
Ma, Gaoqun ;
Yuan, Chunfeng ;
Li, Bing ;
Zhang, Hui ;
Wang, Fangshi ;
Hu, Weiming .
PATTERN RECOGNITION, 2020, 103