Slide 69
Slide 69 text
References (ICML’19)
B. Rieck, C. Bock, and K. Borgwardt, “A Persistent Weisfeiler-Lehman Procedure for Graph Classification,” in International Conference on Machine Learning, 2019, pp. 5448–5458.
A. Bojchevski and S. Günnemann, “Adversarial Attacks on Node Embeddings via Graph Poisoning,” in International Conference on Machine Learning, 2019, pp. 695–704.
G. Zhang, H. He, and D. Katabi, “Circuit-GNN: Graph Neural Networks for Distributed Circuit Design,” in International Conference on Machine Learning, 2019, pp. 7364–7373.
Y. Yu, J. Chen, T. Gao, and M. Yu, “DAG-GNN: DAG Structure Learning with Graph Neural Networks,” in International Conference on Machine Learning, 2019, pp. 7154–7163.
J. Ma, P. Cui, K. Kuang, X. Wang, and W. Zhu, “Disentangled Graph Convolutional Networks,” in International Conference on Machine Learning, 2019,pp.4212–4221.
F. Gao, G. Wolf, and M. Hirn, “Geometric Scattering for Graph Data Analysis,” in International Conference on Machine Learning, 2019, pp. 2122–2131.
E. Smith, S. Fujimoto, A. Romero, and D. Meger, “GEOMetrics: Exploiting Geometric Structure for Graph-Encoded Objects,” in International Conference on Machine Learning, 2019, pp. 5866–5876.
M. Qu, Y. Bengio, and J. Tang, “GMNN: Graph Markov Neural Networks,” in International Conference on Machine Learning, 2019, pp. 5241–5250.
I. Walker and B. Glocker, “Graph Convolutional Gaussian Processes,” in International Conference on Machine Learning, 2019, pp. 6495–6504.
F. Alet, A. K. Jeewajee, M. B. Villalonga, A. Rodriguez, T. Lozano-Perez, and L. Kaelbling, “Graph Element Networks: adaptive, structured computation and memory,” in International Conference on Machine
Learning, 2019, pp. 212–222.
Y. Li, C. Gu, T. Dullien, O. Vinyals, and P. Kohli, “Graph Matching Networks for Learning the Similarity of Graph Structured Objects,” in International Conference on Machine Learning, 2019, pp. 3835–3845.
D. Jeong, T. Kwon, Y. Kim, and J. Nam, “Graph Neural Network for Music Score Data and Modeling Expressive Piano Performance,” in International Conference on Machine Learning, 2019, pp. 3060–3070.
J. Hendrickx, A. Olshevsky, and V. Saligrama, “Graph Resistance and Learning from Pairwise Comparisons,” in International Conference on Machine Learning, 2019, pp. 2702–2711.
H. Gao and S. Ji, “Graph U-Nets,” in International Conference on Machine Learning, 2019, pp. 2083–2092.
A. Grover, A. Zweig, and S. Ermon, “Graphite: Iterative Generative Modeling of Graphs,” in International Conference on Machine Learning, 2019, pp. 2434–2444.
R. Suzuki, R. Takahama, and S. Onoda, “Hyperbolic Disk Embeddings for Directed Acyclic Graphs,” in International Conference on Machine Learning, 2019, pp. 6066–6075.
C. Zhu, S. Storandt, K.-Y. Lam, S. Han, and J. Bi, “Improved Dynamic Graph Learning through Fault-Tolerant Sparsification,” in International Conference on Machine Learning, 2019, pp. 7624–7633.
S. Zhang, X. He, and S. Yan, “LatentGNN: Learning Efficient Non-local Relations for Visual Recognition,” in International Conference on Machine Learning, 2019, pp. 7374–7383.
L. Franceschi, M. Niepert, M. Pontil, and X. He, “Learning Discrete Structures for Graph Neural Networks,” in International Conference on Machine Learning, 2019, pp. 1972–1982.
L. Guo, Z. Sun, and W. Hu, “Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs,” in International Conference on Machine Learning, 2019, pp. 2505–2514.
D. Baranchuk, D. Persiyanov, A. Sinitsin, and A. Babenko, “Learning to Route in Similarity Graphs,” in International Conference on Machine Learning, 2019, pp. 475–484.
S. Abu-El-Haija et al., “MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing,” in International Conference on Machine Learning, 2019, pp. 21–29.
H. Kajino, “Molecular Hypergraph Grammar with Its Application to Molecular Optimization,” in International Conference on Machine Learning, 2019, pp. 3183–3191.
V. Titouan, N. Courty, R. Tavenard, C. Laetitia, and R. Flamary, “Optimal Transport for structured data with application on graphs,” in International Conference on Machine Learning, 2019, pp. 6275–6284.
J. You, R. Ying, and J. Leskovec, “Position-aware Graph Neural Networks,” in International Conference on Machine Learning, 2019, pp. 7134–7143.
R. Murphy, B. Srinivasan, V. Rao, and B. Ribeiro, “Relational Pooling for Graph Representations,” in International Conference on Machine Learning, 2019, pp. 4663–4673.
J. Lee, I. Lee, and J. Kang, “Self-Attention Graph Pooling,” in International Conference on Machine Learning, 2019, pp. 3734–3743.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying Graph Convolutional Networks,” in International Conference on Machine Learning, 2019, pp. 6861–6871.
P. Mercado, F. Tudisco, and M. Hein, “Spectral Clustering of Signed Graphs via Matrix Power Means,” in International Conference on Machine Learning, 2019, pp. 4526–4536.
N. Mehta, L. C. Duke, and P. Rai, “Stochastic Blockmodels meet Graph Neural Networks,” in International Conference on Machine Learning, 2019, pp. 4466–4474. 70