GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders

被引:462
作者
Simonovsky, Martin [1 ]
Komodakis, Nikos
机构
[1] Univ Paris Est, Imagine, Champs Sur Marne, France
来源
ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2018, PT I | 2018年 / 11139卷
关键词
D O I
10.1007/978-3-030-01418-6_41
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep learning on graphs has become a popular research topic with many applications. However, past work has concentrated on learning graph embedding tasks, which is in contrast with advances in generative models for images and text. Is it possible to transfer this progress to the domain of graphs? We propose to sidestep hurdles associated with linearization of such discrete structures by having a decoder output a probabilistic fully-connected graph of a predefined maximum size directly at once. Our method is formulated as a variational autoencoder. We evaluate on the challenging task of molecule generation.
引用
收藏
页码:412 / 422
页数:11
相关论文
共 24 条
[1]  
[Anonymous], 2017, CoRR
[2]  
[Anonymous], CORR
[3]  
[Anonymous], RDKit: Open-source cheminformatics
[4]  
[Anonymous], CORR
[5]  
[Anonymous], 2016, P 4 INT C LEARNING R
[6]  
[Anonymous], 2017, PMLR
[7]  
[Anonymous], 2015, ARXIV
[8]  
Bengio S., 2015, NEURIPS, P1171, DOI DOI 10.5555/2969239.2969370
[9]  
Bowman S. R., 2016, P 20 SIGNLL C COMP N, P10, DOI [DOI 10.18653/V1/K16-1002, 10.18653/v1/K16-1002]
[10]   Geometric Deep Learning Going beyond Euclidean data [J].
Bronstein, Michael M. ;
Bruna, Joan ;
LeCun, Yann ;
Szlam, Arthur ;
Vandergheynst, Pierre .
IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (04) :18-42