Fetching the paper…
Reading the bibliography…
This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space.
Optimal algorithms for comparing trees with labeled leaves
Day, W. H · 1985
Earlier work this paper cites.
Stochastic blockmodels for directed graphs
Wang, Y. J. and Wong, G. Y · 1987
Earlier work this paper cites.
Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., and Hansch, C · 1991
Earlier work this paper cites.
Estimation and prediction for stochastic blockstructures
Nowicki, K. and Snijders, T. A. B · 2001
Earlier work this paper cites.
On graph kernels: Hardness results and efficient alternatives
Gärtner, T., Flach, P., and Wrobel, S · 2003
Earlier work this paper cites.
Spline-fitting with a genetic algorithm: A method for developing classification structure- activity relationships
Sutherland, J. J., O’brien, L. A., and Weaver, D. F · 2003
Earlier work this paper cites.
Shortest-path kernels on graphs
Borgwardt, K. M. and Kriegel, H.-P · 2005
Earlier work this paper cites.
Image classification with segmentation graph kernels
Bach, F. and Harchaoui, Z · 2007
Earlier work this paper cites.
Predicting Structured Data (Neural Information Processing)
Bakir, G. H., Hofmann, T., Schölkopf, B., Smola, A. J., Taskar, B., and Vishwanathan, S. V. N · 2007
Earlier work this paper cites.
Support vector machine classification with indefinite kernels
Luss, R. and d’Aspremont, A · 2007
Earlier work this paper cites.
Optimal Transport: Old and New
Villani, C · 2008
Earlier work this paper cites.
Comparison of descriptor spaces for chemical compound retrieval and classification
Wale, N., Watson, I. A., and Karypis, G · 2008
Earlier work this paper cites.
Efficient graphlet kernels for large graph comparison, 2009
Shervashidze, N., Vishwanathan, S. V. N., Petri, T. H., Mehlhorn, K., and et al · 2009
Earlier work this paper cites.
Graph kernels
Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R., and Borgwardt, K. M · 2010
Earlier work this paper cites.
Barycenters in the wasserstein space
Agueh, M. and Carlier, G · 2011
Earlier work this paper cites.
Gromov wasserstein distances and the metric approach to object matching
Memoli, F · 2011
Earlier work this paper cites.
Weisfeiler-lehman graph kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., and Borgwardt, K. M · 2011
Cited alongside, same era.
Scalable kernels for graphs with continuous attributes
Feragen, A., Kasenburg, N., Petersen, J., de Bruijne, M., and Borgwardt, K · 2013
Cited alongside, same era.
Fast computation of wasserstein barycenters
Cuturi, M. and Doucet, A · 2014
Cited alongside, same era.
Regularized discrete optimal transport
Ferradans, S., Papadakis, N., Peyré, G., and Aujol, J.-F · 2014
Cited alongside, same era.
Optimal transport with laplacian regularization: Applications to domain adaptation and shape matching
Flamary, R., Courty, N., Tuia, D., and Rakotomamonjy, A · 2014
Cited alongside, same era.
Yanardag, P. and Vishwanathan, S · 2015
Entropic metric alignment for correspondence problems
Solomon, J., Peyré, G., Kim, V. G., and Sra, S · 2016
Later among the works it cites.
Wasserstein generative adversarial networks
Arjovsky, M., Chintala, S., and Bottou, L · 2017
Later among the works it cites.
Geometric deep learning: going beyond euclidean data
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., and Vandergheynst, P · 2017
Later among the works it cites.
Optimal transport for domain adaptation
Courty, N., Flamary, R., Tuia, D., and Rakotomamonjy, A · 2017
Later among the works it cites.
Soft-DTW: a differentiable loss function for time-series
Cuturi, M. and Blondel, M · 2017
Later among the works it cites.
Pot python optimal transport library
Flamary, R. and Courty, N · 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.
Convolutional neural networks on graphs with fast localized spectral filtering
Defferrard, M., Bresson, X., and Vandergheynst, P · 2016
Cited alongside, same era.
Supervised word mover’s distance
Huang, G., Guo, C., Kusner, M., Sun, Y., Sha, F., and Weinberger, K · 2016
Cited alongside, same era.
Benchmark data sets for graph kernels, 2016
Kersting, K., Kriege, N. M., Morris, C., Mutzel, P., and Neumann, M · 2016
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
Kipf, T. N. and Welling, M · 2016
Cited alongside, same era.
On valid optimal assignment kernels and applications to graph classification
Kriege, N. M., Giscard, P., and Wilson, R. C · 2016
Cited alongside, same era.
Convergence rate of frank-wolfe for non-convex objectives
Lacoste-Julien, S · 2016
Cited alongside, same era.
Distance metric learning using graph convolutional networks: Application to functional brain networks
Ktena, S. I., Parisot, S., Ferrante, E., Rajchl, M., Lee, M., Glocker, B., and Rueckert, D · 2017
Later among the works it cites.
Matching node embeddings for graph similarity
Nikolentzos, G., Meladianos, P., and Vazirgiannis, M · 2017
Later among the works it cites.
A transportation l p l^{p} distance for signal analysis
Thorpe, M., Park, S., Kolouri, S., Rohde, G. K., and Slepčev, D · 2017
Later among the works it cites.
Hunt for the unique, stable, sparse and fast feature learning on graphs
Verma, S. and Zhang, Z.-L · 2017
Later among the works it cites.
Structured Optimal Transport
Alvarez-Melis, D., Jaakkola, T. S., and Jegelka, S · 2018
Closest in time.
Relational inductive biases, deep learning, and graph networks
Battaglia, P. W., Hamrick, J. B., Bapst, V., Sanchez-Gonzalez, A., Zambaldi, V., Malinowski, M., Tacchetti, A., Raposo, D., Santoro, A., Faulkner, R., Gulcehre, C., Song, F., Ballard, A., Gilmer, J., Dahl, G., Vaswani, A., Allen, K., Nash, C., Langston, V., Dyer, C., Heess, N., Wierstra, D., Kohli, P., Botvinick, M., Vinyals, O., Li, Y., and Pascanu, R · 2018
Closest in time.
Recognizing cuneiform signs using graph based methods
Kriege, N., Fey, M., Fisseler, D., Mutzel, P., and Weichert, F · 2018
Closest in time.
Computational optimal transport
Peyré, G. and Cuturi, M · 2018
Closest in time.
GraKeL: A Graph Kernel Library in Python
Siglidis, G., Nikolentzos, G., Limnios, S., Giatsidis, C., Skianis, K., and Vazirgianis, M · 2018
Closest in time.