Fetching the paper…
Reading the bibliography…
Representing a graph as a vector is a challenging task; ideally, the representation should be easily computable and conducive to efficient comparisons among graphs, tailored to the particular data and analytical task at hand.
Curve and surface fitting with splines
Paul Dierckx. 1995 · 1995
Earlier work this paper cites.
On graph kernels: Hardness results and efficient alternatives
Thomas Gärtner, Peter Flach, and Stefan Wrobel. 2003 · 2003
Earlier work this paper cites.
Shortest-path kernels on graphs. In Data Mining, Fifth IEEE International Conference on
Karsten M Borgwardt and Hans-Peter Kriegel. 2005 · 2005
Earlier work this paper cites.
Convergence of Laplacian eigenmaps. In Advances in Neural Information Processing Systems
Mikhail Belkin and Partha Niyogi. 2007 · 2007
Earlier work this paper cites.
Fast subtree kernels on graphs. In Advances in neural information processing systems
Nino Shervashidze and Karsten M Borgwardt. 2009 · 2009
Earlier work this paper cites.
Shape google: Geometric words and expressions for invariant shape retrieval
Alexander M Bronstein, Michael M Bronstein, Leonidas J Guibas, and Maks Ovsjanikov. 2011 · 2011
Earlier work this paper cites.
LIBSVM: a library for support vector machines
Chih-Chung Chang and Chih-Jen Lin. 2011 · 2011
Earlier work this paper cites.
Stochastic blockmodels and community structure in networks
Brian Karrer and Mark EJ Newman. 2011 · 2011
Cited alongside, same era.
A spectral notion of Gromov–Wasserstein distance and related methods
Facundo Mémoli. 2011 · 2011
Cited alongside, same era.
Weisfeiler-lehman graph kernels
Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011 · 2011
Cited alongside, same era.
A panoramic view of Riemannian geometry
Marcel Berger. 2012 · 2012
Cited alongside, same era.
Network similarity via multiple social theories. In ASONAM
Michele Berlingerio, Danai Koutra, Tina Eliassi-Rad, and Christos Faloutsos. 2013 · 2013
Cited alongside, same era.
Pinar Yanardag and SVN Vishwanathan. 2015 · 2015
Efficient Comparison of Massive Graphs Through The Use Of Graph Fingerprints. In Twelfth Workshop on Mining and Learning with Graphs (MLG) Workshop at KDD’16
Stephen Bonner, John Brennan, Ibad Kureshi, G Theodoropoulos, and AS McGough. 2016 · 2016
Later among the works it cites.
Benchmark Data Sets for Graph Kernels
Kristian Kersting, Nils M. Kriege, Christopher Morris, Petra Mutzel, and Marion Neumann. 2016 · 2016
Later among the works it cites.
The multiscale laplacian graph kernel. In Advances in Neural Information Processing Systems
Risi Kondor and Horace Pan. 2016 · 2016
Later among the works it cites.
Learning convolutional neural networks for graphs. In International conference on machine learning
Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016 · 2016
Later among the works it cites.
Self-normalizing neural networks. In Advances in Neural Information Processing Systems
Günter Klambauer, Thomas Unterthiner, Andreas Mayr, and Sepp Hochreiter. 2017 · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Diffusion-convolutional neural networks. In Advances in Neural Information Processing Systems
James Atwood and Don Towsley. 2016 · 2016
Cited alongside, same era.
Matching Node Embeddings for Graph Similarity.. In AAAI
Giannis Nikolentzos, Polykarpos Meladianos, and Michalis Vazirgiannis. 2017 · 2017
Later among the works it cites.
Hunt For The Unique, Stable, Sparse And Fast Feature Learning On Graphs. In Advances in Neural Information Processing Systems
Saurabh Verma and Zhi-Li Zhang. 2017 · 2017
Later among the works it cites.