Sequence-to-sequence modeling for graph representation learning

被引:5
作者
Taheri, Aynaz [1 ]
Gimpel, Kevin [2 ]
Berger-Wolf, Tanya [1 ]
机构
[1] Univ Illinois, Chicago, IL 60607 USA
[2] Toyota Technol Inst Chicago, Chicago, IL USA
关键词
Graph representation learning; Deep learning; Graph classification; Recurrent models;
D O I
10.1007/s41109-019-0174-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose sequence-to-sequence architectures for graph representation learning in both supervised and unsupervised regimes. Our methods use recurrent neural networks to encode and decode information from graph-structured data. Recurrent neural networks require sequences, so we choose several methods of traversing graphs using different types of substructures with various levels of granularity to generate sequences of nodes for encoding. Our unsupervised approaches leverage long short-term memory (LSTM) encoder-decoder models to embed the graph sequences into a continuous vector space. We then represent a graph by aggregating its graph sequence representations. Our supervised architecture uses an attention mechanism to collect information from the neighborhood of a sequence. The attention module enriches our model in order to focus on the subgraphs that are crucial for the purpose of a graph classification task. We demonstrate the effectiveness of our approaches by showing improvements over the existing state-of-the-art approaches on several graph classification tasks.
引用
收藏
页数:26
相关论文
共 59 条
[1]   Distributed Representations of Subgraphs [J].
Adhikari, Bijaya ;
Zhang, Yao ;
Ramakrishnan, Naren ;
Prakash, B. Aditya .
2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW 2017), 2017, :111-117
[2]  
Akoglu L, 2010, LECT NOTES ARTIF INT, V6119, P410
[3]  
[Anonymous], 2014, NIPS
[4]  
[Anonymous], 1993, P 6 INT C NEUR INF P
[5]  
[Anonymous], 2018, ARXIV PREPRINT ARXIV
[6]  
[Anonymous], 2011, MLG
[7]  
Bengio S, 2015, ADV NEUR IN, V28
[8]  
Bengio Y., 2018, PROC INT C LEARN REP, P1
[9]  
Berlingerio Michele., 2012, CORR
[10]   Shortest-path kernels on graphs [J].
Borgwardt, KM ;
Kriegel, HP .
Fifth IEEE International Conference on Data Mining, Proceedings, 2005, :74-81