Fetching the paper…
Reading the bibliography…
While the celebrated graph neural networks yield effective representations for individual nodes of a graph, there has been relatively less success in extending to the task of graph similarity learning.
C. Spearman, “The proof and measurement of association between two things,” American Journal of Psychology , 1904
1904
Earlier work this paper cites.
M. G. Kendall, “A new measure of rank correlation,” Biometrika , 1938
1938
Earlier work this paper cites.
P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Transactions on Systems Science and Cybernetics , vol. 4, no. 2, pp. 100–107, 1968
1968
Earlier work this paper cites.
J. J. McGregor, “Backtrack search algorithms and the maximal common subgraph problem,” Software: Practice and Experience , vol. 12, no. 1, pp. 23–34, 1982
1982
Earlier work this paper cites.
H. Bunke and G. Allermann, “Inexact graph matching for structural pattern recognition,” Pattern Recognition Letters , vol. 1, no. 4, pp. 245–253, 1983
1983
Earlier work this paper cites.
J. Bromley, I. Guyon, Y. LeCun, E. Säckinger, and R. Shah, “Signature verification using a “siamese” time delay neural network,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 1994, pp. 737–744
1994
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Computation , vol. 9, no. 8, pp. 1735–1780, 1997
1997
Earlier work this paper cites.
A. P. Bradley, “The use of the area under the ROC curve in the evaluation of machine learning algorithms,” Pattern Recognition , vol. 30, no. 7, pp. 1145–1159, 1997
1997
Earlier work this paper cites.
H. Bunke, “On a relation between graph edit distance and maximum common subgraph,” Pattern Recognition Letters , vol. 18, no. 8, pp. 689–694, 1997
1997
Earlier work this paper cites.
X. Yan and J. Han, “gSpan: Graph-based substructure pattern mining,” in IEEE International Conference on Data Mining . IEEE, 2002, pp. 721–724
2002
Earlier work this paper cites.
T. S. Caetano, J. J. McAuley, L. Cheng, Q. V. Le, and A. J. Smola, “Learning graph matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 31, no. 6, pp. 1048–1058, 2009
2009
Earlier work this paper cites.
Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou, “Comparing stars: On approximating graph edit distance,” Proceedings of the VLDB Endowment , vol. 2, no. 1, pp. 25–36, 2009
2009
Earlier work this paper cites.
K. Riesen, X. Jiang, and H. Bunke, “Exact and inexact graph matching: Methodology and applications,” in Managing and Mining Graph Data , ser. Advances in Database Systems. Springer, 2010, vol. 40, pp. 217–247
2010
Earlier work this paper cites.
X. Gao, B. Xiao, D. Tao, and X. Li, “A survey of graph edit distance,” Pattern Analysis and Applications , vol. 13, no. 1, pp. 113–129, 2010
2010
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2012, pp. 1106–1114
2012
Earlier work this paper cites.
R. Socher, D. Chen, C. D. Manning, and A. Ng, “Reasoning with neural tensor networks for knowledge base completion,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2013, pp. 926–934
2013
Earlier work this paper cites.
K. Riesen, S. Emmenegger, and H. Bunke, “A novel software toolkit for graph edit distance computation,” in International Workshop on Graph-Based Representations in Pattern Recognition . Springer, 2013, pp. 142–151
2013
Earlier work this paper cites.
H. He, K. Gimpel, and J. Lin, “Multi-perspective sentence similarity modeling with convolutional neural networks,” in Empirical Methods in Natural Language Processing . ACL, 2015, pp. 1576–1586
2015
Earlier work this paper cites.
A. Fischer, C. Y. Suen, V. Frinken, K. Riesen, and H. Bunke, “Approximation of graph edit distance based on hausdorff matching,” Pattern Recognition , vol. 48, no. 2, pp. 331–343, 2015
2015
Earlier work this paper cites.
K. Riesen, Structural pattern recognition with graph edit distance - Approximation Algorithms and Applications . Springer, 2015
2015
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in International Conference on Learning Representations . OpenReview.net, 2015
2015
Earlier work this paper cites.
Z. Zhang, Z. Zhang, Y. Zhou, Y. Shen, R. Jin, and D. Dou, “Adversarial attacks on deep graph matching,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2020, pp. 20 834–20 851
2015
Earlier work this paper cites.
L. Bertinetto, J. Valmadre, J. F. Henriques, A. Vedaldi, and P. H. Torr, “Fully-convolutional siamese networks for object tracking,” in European Conference on Computer Vision . Springer, 2016, pp. 850–865
2016
Cited alongside, same era.
R. R. Varior, M. Haloi, and G. Wang, “Gated siamese convolutional neural network architecture for human re-identification,” in European Conference on Computer Vision . Springer, 2016, pp. 791–808
2016
Cited alongside, same era.
J. Mueller and A. Thyagarajan, “Siamese recurrent architectures for learning sentence similarity,” in AAAI Conference on Artificial Intelligence . AAAI, 2016, pp. 2786–2792
2016
Cited alongside, same era.
O. Melamud, J. Goldberger, and I. Dagan, “context2vec: Learning generic context embedding with bidirectional LSTM,” in SIGNLL Conference on Computational Natural Language Learning . ACL, 2016, pp. 51–61
2016
Cited alongside, same era.
Y. Ma, S. Wang, C. C. Aggarwal, and J. Tang, “Graph convolutional networks with eigenpooling,” in ACM SIGKDD Conference on Knowledge Discovery and Data Mining . ACM, 2019, pp. 723–731
2019
Later among the works it cites.
J. Lee, I. Lee, and J. Kang, “Self-attention graph pooling,” in International Conference on Machine Learning . PMLR, 2019, pp. 3734–3743
2019
Later among the works it cites.
Y. Bai, H. Ding, S. Bian, T. Chen, Y. Sun, and W. Wang, “SimGNN: A neural network approach to fast graph similarity computation,” in ACM International Conference on Web Search and Data Mining . ACM, 2019, pp. 384–392
2019
Later among the works it cites.
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 . PMLR, 2019, pp. 3835–3845
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated graph sequence neural networks,” in International Conference on Learning Representations . OpenReview.net, 2016
2016
Cited alongside, same era.
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst, “Geometric deep learning: going beyond euclidean data,” IEEE Signal Processing Magazine , vol. 34, no. 4, pp. 18–42, 2017
2017
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations . OpenReview.net, 2017
2017
Cited alongside, same era.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2017, pp. 1024–1034
2017
Cited alongside, same era.
X. Xu, C. Liu, Q. Feng, H. Yin, L. Song, and D. Song, “Neural network-based graph embedding for cross-platform binary code similarity detection,” in ACM Conference on Computer and Communications Security . ACM, 2017, pp. 363–376
2017
Cited alongside, same era.
J. Shin Yoon, F. Rameau, J. Kim, S. Lee, S. Shin, and I. So Kweon, “Pixel-level matching for video object segmentation using convolutional neural networks,” in IEEE/CVF International Conference on Computer Vision . IEEE, 2017, pp. 2167–2176
2017
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2017, pp. 5998–6008
2017
Cited alongside, same era.
M. Guo, E. Chou, D.-A. Huang, S. Song, S. Yeung, and L. Fei-Fei, “Neural graph matching networks for fewshot 3D action recognition,” in European Conference on Computer Vision . Springer, 2018, pp. 653–669
2018
Cited alongside, same era.
X. Lu, W. Wang, C. Ma, J. Shen, L. Shao, and F. Porikli, “See more, know more: Unsupervised video object segmentation with co-attention siamese networks,” in IEEE/CVF Conference on Computer Vision and Pattern Recognition . CVF/IEEE, 2019, pp. 3623–3632
2019
Later among the works it cites.
C. Zhang, D. Song, C. Huang, A. Swami, and N. V. Chawla, “Heterogeneous graph neural network,” in ACM SIGKDD Conference on Knowledge Discovery and Data Mining . ACM, 2019, pp. 793–803
2019
Later among the works it cites.
S. H. Ding, B. C. Fung, and P. Charland, “Asm2Vec: Boosting static representation robustness for binary clone search against code obfuscation and compiler optimization,” in IEEE Symposium on Security and Privacy . IEEE, 2019, pp. 472–489
2019
Later among the works it cites.
A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Köpf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala, “PyTorch: An imperative style, high-performance deep learning library,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2019, pp. 8024–8035
2019
Later among the works it cites.
M. Fey and J. E. Lenssen, “Fast graph representation learning with PyTorch Geometric,” in ICLR Workshop on Representation Learning on Graphs and Manifolds . OpenReview.net, 2019
2019
Later among the works it cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in International Conference on Learning Representations . OpenReview.net, 2019
2019
Later among the works it cites.
L. Wu, I. E.-H. Yen, Z. Zhang, K. Xu, L. Zhao, X. Peng, Y. Xia, and C. Aggarwal, “Scalable global alignment graph kernel using random features: From node embedding to graph embedding,” in ACM SIGKDD Conference on Knowledge Discovery and Data Mining . ACM, 2019, pp. 1418–1428
2019
Later among the works it cites.
T. Yoshida, I. Takeuchi, and M. Karasuyama, “Learning interpretable metric between graphs: Convex formulation and computation with graph mining,” in ACM SIGKDD Conference on Knowledge Discovery and Data Mining . ACM, 2019, pp. 1026–1036
2019
Later among the works it cites.
X. Ling, S. Ji, J. Zou, J. Wang, C. Wu, B. Li, and T. Wang, “DEEPSEC: A uniform platform for security analysis of deep learning model,” in IEEE Symposium on Security and Privacy . IEEE, 2019, pp. 673–690
2019
Later among the works it cites.
Y. Chen, L. Wu, and M. J. Zaki, “Reinforcement learning based graph-to-sequence model for natural question generation,” in International Conference on Learning Representations . OpenReview.net, 2020
2020
Closest in time.
Y. Chen, L. Wu, and M. Zaki, “Iterative deep graph learning for graph neural networks: Better and robust node embeddings,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2020, pp. 19 314–19 326
2020
Closest in time.
Y. Bai, H. Ding, K. Gu, Y. Sun, and W. Wang, “Learning-based efficient graph similarity computation via multi-scale convolutional set matching,” in AAAI Conference on Artificial Intelligence . AAAI, 2020, pp. 3219–3226
2020
Closest in time.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,” in Advances in Neural Information Processing Systems . Curran Associates, Inc., 2020, pp. 22 118–22 133
2020
Closest in time.
D. B. Blumenthal and J. Gamper, “On the exact computation of the graph edit distance,” Pattern Recognition Letters , vol. 134, pp. 46–57, 2020
2020
Closest in time.
X. Ling, L. Wu, C. Wu, and S. Ji, “Graph neural networks: Graph matching,” in Graph Neural Networks: Foundations, Frontiers, and Applications , L. Wu, P. Cui, J. Pei, and L. Zhao, Eds. Singapore: Springer, 2021, ch. 13, pp. 277–295
2021
Closest in time.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE Transactions on Neural Networks and Learning Systems , vol. 32, no. 1, pp. 4–24, 2021
2021
Closest in time.
X. Ling, L. Wu, S. Wang, G. Pan, T. Ma, F. Xu, A. X. Liu, C. Wu, and S. Ji, “Deep graph matching and searching for semantic code retrieval,” ACM Transactions on Knowledge Discovery from Data , vol. 15, no. 5, pp. 1–21, 2021
2021
Closest in time.
H. Gao and S. Ji, “Graph u-nets,” in International Conference on Machine Learning . PMLR, 2019, pp. 2083–2092
2092
Closest in time.