Fetching the paper…
Reading the bibliography…
Can neural networks learn to compare graphs without feature engineering? In this paper, we show that it is possible to learn representations for graph similarity with neither domain knowledge nor supervision (i.e.\ feature engineering or labeled graphs).
An Information Flow Model for Conflict and Fission in Small Groups
Wayne W. Zachary. 1977 · 1977
Earlier work this paper cites.
Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity
Asim Kumar Debnath, Rosa L. Lopez de Compadre, Gargi Debnath, Alan J. Shusterman, and Corwin Hansch. 1991 · 1991
Earlier work this paper cites.
Collective dynamics of ‘small-world’networks
Duncan J Watts and Steven H Strogatz. 1998 · 1998
Earlier work this paper cites.
A comparison of algorithms for maximum common subgraph on randomly connected graphs. In SSPR . Springer, 123–132
Horst Bunke, Pasquale Foggia, Corrado Guidobaldi, Carlo Sansone, and Mario Vento. 2002 · 2002
Earlier work this paper cites.
Distinguishing enzyme structures from non-enzymes without alignments
Paul D Dobson and Andrew J Doig. 2003 · 2003
Earlier work this paper cites.
Marginalized kernels between labeled graphs. In Proceedings of the 20th international conference on machine learning (ICML-03) . 321–328
Hisashi Kashima, Koji Tsuda, and Akihiro Inokuchi. 2003 · 2003
Earlier work this paper cites.
Statistical evaluation of the predictive toxicology challenge 2000–2001
Hannu Toivonen, Ashwin Srinivasan, Ross D King, Stefan Kramer, and Christoph Helma. 2003 · 2003
Earlier work this paper cites.
Learning with distance substitution kernels. In Joint Pattern Recognition Symposium . Springer, 220–227
Bernard Haasdonk and Claus Bahlmann. 2004 · 2004
Earlier work this paper cites.
Shortest-path kernels on graphs. In Data Mining, Fifth IEEE International Conference on . IEEE, 8–pp
Karsten M Borgwardt and Hans-Peter Kriegel. 2005 · 2005
Earlier work this paper cites.
Protein function prediction via graph kernels
Karsten M Borgwardt, Cheng Soon Ong, Stefan Schönauer, SVN Vishwanathan, Alex J Smola, and Hans-Peter Kriegel. 2005 · 2005
Earlier work this paper cites.
A Generative Model - the Preferential Attachment Scheme
Fan Chung, Fan RK Chung, Fan Chung Graham, Linyuan Lu, Kian Fan Chung, et al · 2006
Earlier work this paper cites.
Finding community structure in networks using the eigenvectors of matrices
M. E. J. Newman. 2006 · 2006
Earlier work this paper cites.
Comparison of descriptor spaces for chemical compound retrieval and classification. In Proceedings - Sixth International Conference on Data Mining, ICDM 2006 . 678–689
Nikil Wale and George Karypis. 2006 · 2006
Earlier work this paper cites.
Fast computation of graph kernels. In Advances in neural information processing systems . 1449–1456
Karsten M Borgwardt, Nicol N Schraudolph, and SVN Vishwanathan. 2007 · 2007
Earlier work this paper cites.
A survey of graph edit distance
Xinbo Gao, Bing Xiao, Dacheng Tao, and Xuelong Li. 2010 · 2010
Earlier work this paper cites.
Web graph similarity for anomaly detection
Panagiotis Papadimitriou, Ali Dasdan, and Hector Garcia-Molina. 2010 · 2010
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al · 2011
Earlier work this paper cites.
Weisfeiler-lehman graph kernels
Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011 · 2011
Earlier work this paper cites.
Netsimile: A scalable approach to size-independent network similarity
Michele Berlingerio, Danai Koutra, Tina Eliassi-Rad, and Christos Faloutsos. 2012 · 2012
Earlier work this paper cites.
Fast random walk graph kernel. In Proceedings of the 2012 SIAM International Conference on Data Mining . SIAM, 828–838
U Kang, Hanghang Tong, and Jimeng Sun. 2012 · 2012
Earlier work this paper cites.
Deltacon: A principled massive-graph similarity function. In Proceedings of the 2013 SIAM International Conference on Data Mining . SIAM, 162–170
Danai Koutra, Joshua T Vogelstein, and Christos Faloutsos. 2013 · 2013
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba. 2014 · 2014
Cited alongside, same era.
Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 701–710
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014 · 2014
Cited alongside, same era.
Attention-Based Models for Speech Recognition
Jan K Chorowski, Dzmitry Bahdanau, Dmitriy Serdyuk, Kyunghyun Cho, and Yoshua Bengio. 2015 · 2015
Cited alongside, same era.
TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems
TensorflowTeam. 2015 · 2015
Cited alongside, same era.
Deep graph kernels. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . ACM, 1365–1374
Pinar Yanardag and SVN Vishwanathan. 2015 · 2015
Cited alongside, same era.
Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017 · 2017
Later among the works it cites.
Community Preserving Network Embedding.. In AAAI . 203–209
Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, and Shiqiang Yang. 2017 · 2017
Later among the works it cites.
Watch Your Step: Learning Node Embeddings via Graph Attention. In Advances in Neural Information Processing Systems . 9198–9208
Sami Abu-El-Haija, Bryan Perozzi, Rami Al-Rfou, and Alexander A Alemi. 2018 · 2018
Later among the works it cites.
Graph Edit Distance Computation via Graph Neural Networks
Yunsheng Bai, Hao Ding, Song Bian, Yizhou Sun, and Wei Wang. 2018 · 2018
Later among the works it cites.
Relational inductive biases, deep learning, and graph networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Learning principled bilingual mappings of word embeddings while preserving monolingual invariance. In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing . Association for Computational Linguistics, 2289–2294
Mikel Artetxe, Gorka Labaka, and Eneko Agirre. 2016 · 2016
Cited alongside, same era.
Deep Neural Networks for Learning Graph Representations. In Proceedings of the Association for the Advancement of Artificial Intelligence
Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2016 · 2016
Cited alongside, same era.
node2vec: Scalable Feature Learning for Networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
A. Grover and J. Leskovec. 2016 · 2016
Cited alongside, same era.
Semi-Supervised Classification with Graph Convolutional Networks
T. Kipf and M. Welling. 2016 · 2016
Cited alongside, same era.
On valid optimal assignment kernels and applications to graph classification. In Advances in Neural Information Processing Systems . 1623–1631
Nils M Kriege, Pierre-Louis Giscard, and Richard Wilson. 2016 · 2016
Cited alongside, same era.
Hierarchical attention networks for document classification. In Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies . 1480–1489
Zichao Yang, Diyi Yang, Chris Dyer, Xiaodong He, Alex Smola, and Eduard Hovy. 2016 · 2016
Cited alongside, same era.
From node embedding to community embedding
Vincent W Zheng, Sandro Cavallari, Hongyun Cai, Kevin Chen-Chuan Chang, and Erik Cambria. 2016 · 2016
Cited alongside, same era.
Peter W Battaglia, Jessica B Hamrick, Victor Bapst, Alvaro Sanchez-Gonzalez, Vinicius Zambaldi, Mateusz Malinowski, Andrea Tacchetti, David Raposo, Adam Santoro, Ryan Faulkner, et al · 2018
Later among the works it cites.
A Tutorial on Network Embeddings
Haochen Chen, Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2018a · 2018
Later among the works it cites.
Harp: Hierarchical representation learning for networks
Haochen Chen, Bryan Perozzi, Yifan Hu, and Steven Skiena. 2018b · 2018
Later among the works it cites.
A survey on network embedding
Peng Cui, Xiao Wang, Jian Pei, and Wenwu Zhu. 2018 · 2018
Later among the works it cites.
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe. 2018 · 2018
Later among the works it cites.
Learning Graph Representations with Recurrent Neural Network Autoencoders. In KDD’18 Deep Learning Day
Aynaz Taheri, Kevin Gimpel, and Tanya Berger-Wolf. 2018 · 2018
Later among the works it cites.
Graph Classification with 2D Convolutional Neural Networks
Antoine J-P Tixier, Giannis Nikolentzos, Polykarpos Meladianos, and Michalis Vazirgiannis. 2018 · 2018
Later among the works it cites.
NetLSD: Hearing the Shape of a Graph
Anton Tsitsulin, Davide Mottin, Panagiotis Karras, Alex Bronstein, and Emmanuel Müller. 2018 · 2018
Later among the works it cites.
D2KE: From Distance to Kernel and Embedding
Lingfei Wu, Ian En-Hsu Yen, Fangli Xu, Pradeep Ravikuma, and Michael Witbrock. 2018 · 2018
Later among the works it cites.
On the Dimensionality of Word Embedding
Zi Yin and Yuanyuan Shen. 2018 · 2018
Later among the works it cites.
Hierarchical Graph Representation Learning with Differentiable Pooling
Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L Hamilton, and Jure Leskovec. 2018 · 2018
Later among the works it cites.
An end-to-end deep learning architecture for graph classification
Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen. 2018 · 2018
Later among the works it cites.
Deep Variational Network Embedding in Wasserstein Space. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 2827–2836
Dingyuan Zhu, Peng Cui, Daixin Wang, and Wenwu Zhu. 2018 · 2018
Later among the works it cites.
Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts
Alessandro Epasto and Bryan Perozzi. 2019 · 2019
Closest in time.
Learning convolutional neural networks for graphs. In International conference on machine learning . 2014–2023
Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016b · 2023
Closest in time.
Show, attend and tell: Neural image caption generation with visual attention. In International conference on machine learning . 2048–2057
Kelvin Xu, Jimmy Ba, Ryan Kiros, Kyunghyun Cho, Aaron Courville, Ruslan Salakhudinov, Rich Zemel, and Yoshua Bengio. 2015 · 2057
Closest in time.