Learning convolutional neural networks for graphs

33rd International Conference on Machine Learning, ICML 2016

Volumn 4, Issue , 2016, Pages 2958-2967

  Niepert, Mathias ^a   Ahmad, Mohamed ^a   Kutzkov, Konstantin ^a  

^a NEC LABORATORIES EUROPE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONVOLUTION; GRAPHIC METHODS; LEARNING SYSTEMS; NEURAL NETWORKS;

ARBITRARY GRAPHS; BENCHMARK DATA; CONNECTED REGION; CONVOLUTIONAL NETWORKS; CONVOLUTIONAL NEURAL NETWORK; FEATURE REPRESENTATION; GRAPH KERNELS; STATE OF THE ART;

DIRECTED GRAPHS;

EID: 84999027836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (45)

1. Alon, Uri. Network motifs: Theory and experimental approaches. Nature Reviews Genetics, 8(6):450-461, 2007.
2. Atlas, Les E., Homma, Toshiteru, and Marks, Robert J. N. An artificial neural network for spatio-temporal bipolar patterns: Application to phoneme classification. In Anderson, D.Z. (ed.), Neural Information Processing Systems, pp. 31-40. 1988.
3. Babai, Laszlo, Erdos, Paul, and Selkow, Stanley M. Random graph isomorphism. SIAMJ. Computing, 9(3):628- 635, 1980.
4. Barabasi, Albert-Laszlo and Albert, Reka. Emergence of scaling in random networks. Science, 286(5439):509- 512, 1999.
5. Bergstra, James, Breuleux, Olivier, Bastien, Frederic, Lamblin, Pascal, Pascanu, Razvan, Desjardins, Guil- laume, Turian, Joseph, Warde-Farley, David, and Ben-gio, Yoshua. Theano: A CPU and GPU math expression compiler. In Proceedings of the Python for Scientific Computing Conference (SciPy), 2010.
6. Berkholz, Christoph, Bonsma, Paul S., and Grohe, Martin. Tight lower and upper bounds for the complexity of canonical colour refinement. In Proceedings of the European Symposium on Algorithms, pp. 145-156, 2013.
7. Borgwardt, Karsten M. and Kriegel, Hans-Peter. Shortest- path kernels on graphs. In Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM), pp. 74-81, 2005.
8. Bruna, Joan, Zaremba, Wojciech, Szlam, Arthur, and Le- Cun, Yann. Spectral networks and locally connected networks on graphs. In International Conference on Learning Representations, 2014.
9. Chang, Chih-Chung and Lin, Chih-Jen. Libsvm: A library for support vector machines. ACM Trans. Intell. Syst. Technol., 2(3):271-2727, 2011.
10. Chollet, Franois. keras. https://github.com/fchollet/keras, 2015.
11. Debnath, Asim Kumar, de Compadre, Rosa L. Lopez, Deb- nath, Gargi, Shusterman, Alan J., and Hansch, Cor-win. Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds, correlation with molecular orbital energies and hydrophobicity. J. Med. Chem., (34):786-797, 1991.
12. Dobson, Paul D. and Doig, Andrew J. Distinguishing enzyme structures from non-enzymes without alignments. Journal of Molecular Biology, 330(4):771 - 783, 2003.
13. Douglas, Brendan L. The weisfeiler-lehman method and graph isomorphism testing. arXiv preprint arXiv: 1101.5211, 2011.
14. Duvenaud, David K, Maclaurin, Dougal, Iparraguirre, Jorge, Bombarell, Rafael, Hirzel, Timothy, Aspuru- Guzik, Alan, and Adams, Ryan P. Convolutional networks on graphs for learning molecular fingerprints. In Advances in Neural Information Processing Systems, pp. 2215-2223, 2015.
15. Freund, Yoav and Haussler, David. Unsupervised learning of distributions of binary vectors using two layer networks. In Advances in Neural Information Processing Systems, pp. 912-919, 1992.
16. Fukushima, Kunihiko. Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position. Biological Cybernetics, 36(4): 193-202, 1980.
17. Gaertner, Thomas, Flach, Peter, and Wrobel, Stefan. On graph kernels: Hardness results and efficient alternatives. In Proceedings of the 16th Annual Conference on Computational Learning Theory, pp. 129-143, 2003.
18. Haussler, David. Convolution kernels on discrete structures. Technical report, Department of Computer Science, University of California at Santa Cruz, 1999.
19. Henaff, Mikael, Bruna, Joan, and LeCun, Yann. Deep convolutional networks on graph-structured data. arXiv preprint arXiv: 1506.05163, 2015.
20. Hubel, David H. and Wiesel, Torsten N. Receptive fields and functional architecture of monkey striate cortex. Journal of Physiology (London), 195:215-243, 1968.
21. Kersting, Kristian, Ahmadi, Babak, and Natarajan, Sri- raam. Counting belief propagation. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI), pp. 277-284, 2009.
22. Kersting, Kristian, Mladenov, Martin, Garnett, Roman, and Grohe, Martin. Power iterated color refinement. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AMI), pp. 1904-1910, 2014.
23. Kondor, Risi and Borgwardt, Karsten M. The skew spectrum of graphs. In Proceedings of the 25th International Conference on Machine Learning (ICML), pp. 496-503, 2008.
24. Kondor, Risi and Lafferty, John. Diffusion kernels on graphs and other discrete input spaces. In Proceedings of the 19th International Conference on Machine Learning (ICML), pp. 315-322, 2002.
25. Kondor, Risi, Shervashidze, Nino, and Borgwardt, Karsten M. The graphlet spectrum. In Proceedings of the 26th International Conference on Machine Learning (ICML), pp. 529-536, 2009.
26. LeCun, Y., Boser, B., Denker, J. S., Henderson, D., Howard, R. E., Hubbard, W., and Jackel, L. D. Back- propagation applied to handwritten zip code recognition. Neural Comput., 1(4):541-551, 1989.
27. LeCun, Yann, Bottou, Leon, Bengio, Yoshua, and Haffner, Patrick. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278- 2324, 1998.
28. LeCun, Yann, Bengio, Yoshua, and Hinton, Geoffrey. Deep learning. Nature, 521:436-444, 2015.
29. Leskovec, Jure, Lang, Kevin J, Dasgupta, Anirban, and Mahoney, Michael W. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29- 123, 2009.
30. Li, Yujia, Tarlow, Daniel, Brockschmidt, Marc, and Zemel, Richard. Gated graph sequence neural networks. arXiv preprint arXiv: 1511.05493, 2015.
31. Luks, Eugene M. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences, (25):42-65, 1982.
32. McKay, Brendan D. and Piperno, Adolfo. Practical graph isomorphism, {II}. Journal of Symbolic Computation, 60(0):94- 112, 2014.
33. Milo, Ron, Shen-Orr, Shai, Itzkovitz, Shalev, Kashtan, Nadav, Chklovskii, Dmitri, and Alon, Uri. Network motifs: simple building blocks of complex networks. Science, 298(5594):824-827, 2002.
34. Miyazaki, Takunari. The complexity of mckays canonical labeling algorithm. In Groups and Computation II, volume 28, pp. 239-256, 1997.
35. Newman, Mark EJ. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98(2):404-409, 2001.
36. Orsini, E, Frasconi, P., and Raedt, L. De. Graph invariant kernels. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 678-689, 2015.
37. Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., and Monfardini, G. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61-80, 2009.
38. Shervashidze, Nino, Vishwanathan, S.V.N., Petri, Tobias H., Mehlhorn, Kurt, and Borgwardt, Karsten M. Efficient graphlet kernels for large graph comparison. In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 488- 495, 2009.
39. Shervashidze, Nino, Schweitzer, Pascal, van Leeuwen, Erik Jan, Mehlhorn, Kurt, and Borgwardt, Karsten M. Weisfeiler-lehman graph kernels. J. Mach. Learn. Res., 12:2539-2561, 2011.
40. Toivonen, Hannu, Srinivasan, Ashwin, King, Ross D, Kramer, Stefan, and Helma, Christoph. Statistical evaluation of the predictive toxicology challenge 2000-2001. Bioinformatics, 19(10): 1183-1193, 2003.
41. Vishwanathan, S. V. N., Schraudolph, Nicol N., Kondor, Risi, and Borgwardt, Karsten M. Graph kernels. J. Mach. Learn. Res., 11:1201-1242, 2010.
42. Wale, Nikil and Karypis, George. Comparison of descriptor spaces for chemical compound retrieval and classification. In Proceedings of the International Conference on Data Mining (ICDM), pp. 678-689, 2006.
43. Wallach, Izhar, Dzamba, Michael, and Heifets, Abraham. Atomnet: A deep convolutional neural network for bioactivity prediction in structure-based drug discovery. CoRR, abs/1510.02855, 2015.
44. Weisfeiler, Boris and Lehman, AA. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia, 2(9): 12-16, 1968.
45. Yanardag, Pinar and Vishwanathan, S.V.N. Deep graph kernels. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1365-1374, 2015.