{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:02:19Z","timestamp":1778788939469,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Key Research and Development Program","award":["2019YFF0302601"],"award-info":[{"award-number":["2019YFF0302601"]}]},{"name":"National Natural Science Foundation of China","award":["61972349"],"award-info":[{"award-number":["61972349"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467328","type":"proceedings-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T18:21:39Z","timestamp":1628878899000},"page":"2274-2284","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["H2MN"],"prefix":"10.1145","author":[{"given":"Zhen","family":"Zhang","sequence":"first","affiliation":[{"name":"Zhejiang University & Alibaba-Zhejiang University Joint Institute of Frontier Technologies, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajun","family":"Bu","sequence":"additional","affiliation":[{"name":"Zhejiang University & Alibaba-Zhejiang University Joint Institute of Frontier Technologies, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Ester","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Vancouver, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group & Alibaba-Zhejiang University Joint Institute of Frontier Technologies, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengwei","family":"Yao","sequence":"additional","affiliation":[{"name":"Zhejiang University & Alibaba-Zhejiang University Joint Institute of Frontier Technologies, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Yu","sequence":"additional","affiliation":[{"name":"Zhejiang University & Alibaba-Zhejiang University Joint Institute of Frontier Technologies, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"2019 b. Hypergraph convolution and hypergraph attention. arXiv:1901.08150","author":"Bai Song","year":"2019","unstructured":"Song Bai , Feihu Zhang , and Philip HS Torr . 2019 b. Hypergraph convolution and hypergraph attention. arXiv:1901.08150 ( 2019 ). Song Bai, Feihu Zhang, and Philip HS Torr. 2019 b. Hypergraph convolution and hypergraph attention. arXiv:1901.08150 (2019)."},{"key":"e_1_3_2_2_2_1","unstructured":"Yunsheng Bai Hao Ding Song Bian Ting Chen Yizhou Sun and Wei Wang. 2019 a. Simgnn: A neural network approach to fast graph similarity computation. In WSDM. 384--392. Yunsheng Bai Hao Ding Song Bian Ting Chen Yizhou Sun and Wei Wang. 2019 a. Simgnn: A neural network approach to fast graph similarity computation. In WSDM. 384--392."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Yunsheng Bai Hao Ding Ken Gu Yizhou Sun and Wei Wang. 2020. Learning-Based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching.. In AAAI. 3219--3226. Yunsheng Bai Hao Ding Ken Gu Yizhou Sun and Wei Wang. 2020. Learning-Based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching.. In AAAI. 3219--3226.","DOI":"10.1609\/aaai.v34i04.5720"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.05.002"},{"key":"e_1_3_2_2_5_1","volume-title":"The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern recognition","author":"Bradley Andrew P","year":"1997","unstructured":"Andrew P Bradley . 1997. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern recognition , Vol. 30 , 7 ( 1997 ), 1145--1159. Andrew P Bradley. 1997. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern recognition, Vol. 30, 7 (1997), 1145--1159."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Jane Bromley Isabelle Guyon Yann LeCun Eduard S\"ackinger and Roopak Shah. 1994. Signature verification using a \"siamese\" time delay neural network. In NIPS. 737--744. Jane Bromley Isabelle Guyon Yann LeCun Eduard S\"ackinger and Roopak Shah. 1994. Signature verification using a \"siamese\" time delay neural network. In NIPS. 737--744.","DOI":"10.1142\/9789812797926_0003"},{"key":"e_1_3_2_2_7_1","volume-title":"Spectral networks and locally connected networks on graphs. arXiv:1312.6203","author":"Bruna Joan","year":"2013","unstructured":"Joan Bruna , Wojciech Zaremba , Arthur Szlam , and Yann LeCun . 2013. Spectral networks and locally connected networks on graphs. arXiv:1312.6203 ( 2013 ). Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun. 2013. Spectral networks and locally connected networks on graphs. arXiv:1312.6203 (2013)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"e_1_3_2_2_9_1","volume-title":"A graph distance metric based on the maximal common subgraph. Pattern recognition letters","author":"Bunke Horst","year":"1998","unstructured":"Horst Bunke and Kim Shearer . 1998. A graph distance metric based on the maximal common subgraph. Pattern recognition letters , Vol. 19 , 3--4 ( 1998 ), 255--259. Horst Bunke and Kim Shearer. 1998. A graph distance metric based on the maximal common subgraph. Pattern recognition letters, Vol. 19, 3--4 (1998), 255--259."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Lu Chen Yunjun Gao Yuanliang Zhang Sibo Wang and Baihua Zheng. 2018. Scalable hypergraph-based image retrieval and tagging system. In ICDE. 257--268. Lu Chen Yunjun Gao Yuanliang Zhang Sibo Wang and Baihua Zheng. 2018. Scalable hypergraph-based image retrieval and tagging system. In ICDE. 257--268.","DOI":"10.1109\/ICDE.2018.00032"},{"key":"e_1_3_2_2_11_1","unstructured":"Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NIPS. 3844--3852. Micha\u00ebl Defferrard Xavier Bresson and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In NIPS. 3844--3852."},{"key":"e_1_3_2_2_12_1","volume-title":"Edge contraction pooling for graph neural networks. arXiv:1905.10990","author":"Diehl Frederik","year":"2019","unstructured":"Frederik Diehl . 2019. Edge contraction pooling for graph neural networks. arXiv:1905.10990 ( 2019 ). Frederik Diehl. 2019. Edge contraction pooling for graph neural networks. arXiv:1905.10990 (2019)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20844-7_11"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"e_1_3_2_2_15_1","volume-title":"Fast graph representation learning with PyTorch Geometric. arXiv:1903.02428","author":"Fey Matthias","year":"2019","unstructured":"Matthias Fey and Jan Eric Lenssen . 2019. Fast graph representation learning with PyTorch Geometric. arXiv:1903.02428 ( 2019 ). Matthias Fey and Jan Eric Lenssen. 2019. Fast graph representation learning with PyTorch Geometric. arXiv:1903.02428 (2019)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.015"},{"key":"e_1_3_2_2_17_1","volume-title":"Graph u-nets. arXiv:1905.05178","author":"Gao Hongyang","year":"2019","unstructured":"Hongyang Gao and Shuiwang Ji. 2019. Graph u-nets. arXiv:1905.05178 ( 2019 ). Hongyang Gao and Shuiwang Ji. 2019. Graph u-nets. arXiv:1905.05178 (2019)."},{"key":"e_1_3_2_2_18_1","unstructured":"Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural Message Passing for Quantum Chemistry. In ICML. 1263--1272. Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural Message Passing for Quantum Chemistry. In ICML. 1263--1272."},{"key":"e_1_3_2_2_19_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS. 1024--1034. Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS. 1024--1034."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Tam\u00e1s Horv\u00e1th Thomas G\u00e4rtner and Stefan Wrobel. 2004. Cyclic pattern kernels for predictive graph mining. In SIGKDD. 158--167. Tam\u00e1s Horv\u00e1th Thomas G\u00e4rtner and Stefan Wrobel. 2004. Cyclic pattern kernels for predictive graph mining. In SIGKDD. 158--167.","DOI":"10.1145\/1014052.1014072"},{"key":"e_1_3_2_2_22_1","volume-title":"Attpool: Towards hierarchical feature representation in graph convolutional networks via attention mechanism. In ICCV. 6480--6489.","author":"Huang Jingjia","year":"2019","unstructured":"Jingjia Huang , Zhangheng Li , Nannan Li , Shan Liu , and Ge Li . 2019 . Attpool: Towards hierarchical feature representation in graph convolutional networks via attention mechanism. In ICCV. 6480--6489. Jingjia Huang, Zhangheng Li, Nannan Li, Shan Liu, and Ge Li. 2019. Attpool: Towards hierarchical feature representation in graph convolutional networks via attention mechanism. In ICCV. 6480--6489."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Jianwen Jiang Yuxuan Wei Yifan Feng Jingxuan Cao and Yue Gao. 2019. Dynamic Hypergraph Neural Networks.. In IJCAI. 2635--2641. Jianwen Jiang Yuxuan Wei Yifan Feng Jingxuan Cao and Yue Gao. 2019. Dynamic Hypergraph Neural Networks.. In IJCAI. 2635--2641.","DOI":"10.24963\/ijcai.2019\/366"},{"key":"e_1_3_2_2_24_1","volume-title":"Adam: A method for stochastic optimization. arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_25_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_26_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv:1810.05997","author":"Klicpera Johannes","year":"2018","unstructured":"Johannes Klicpera , Aleksandar Bojchevski , and Stephan G\u00fcnnemann . 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv:1810.05997 ( 2018 ). Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_2_27_1","volume-title":"Self-attention graph pooling. arXiv:1904.08082","author":"Lee Junhyun","year":"2019","unstructured":"Junhyun Lee , Inyeop Lee , and Jaewoo Kang . 2019. Self-attention graph pooling. arXiv:1904.08082 ( 2019 ). Junhyun Lee, Inyeop Lee, and Jaewoo Kang. 2019. Self-attention graph pooling. arXiv:1904.08082 (2019)."},{"key":"e_1_3_2_2_28_1","unstructured":"Yujia Li Chenjie Gu Thomas Dullien Oriol Vinyals and Pushmeet Kohli. 2019. Graph Matching Networks for Learning the Similarity of Graph Structured Objects. In ICML. 3835--3845. Yujia Li Chenjie Gu Thomas Dullien Oriol Vinyals and Pushmeet Kohli. 2019. Graph Matching Networks for Learning the Similarity of Graph Structured Objects. In ICML. 3835--3845."},{"key":"e_1_3_2_2_29_1","unstructured":"Yongzhi Li Duo Zhang and Yadong Mu. 2020. Visual-Semantic Matching by Exploring High-Order Attention and Distraction. In CVPR. 12786--12795. Yongzhi Li Duo Zhang and Yadong Mu. 2020. Visual-Semantic Matching by Exploring High-Order Attention and Distraction. In CVPR. 12786--12795."},{"key":"e_1_3_2_2_30_1","volume-title":"Hierarchical graph matching networks for deep graph similarity learning. arXiv:2007.04395","author":"Ling Xiang","year":"2020","unstructured":"Xiang Ling , Lingfei Wu , Saizhuo Wang , Tengfei Ma , Fangli Xu , Alex X Liu , Chunming Wu , and Shouling Ji. 2020. Hierarchical graph matching networks for deep graph similarity learning. arXiv:2007.04395 ( 2020 ). Xiang Ling, Lingfei Wu, Saizhuo Wang, Tengfei Ma, Fangli Xu, Alex X Liu, Chunming Wu, and Shouling Ji. 2020. Hierarchical graph matching networks for deep graph similarity learning. arXiv:2007.04395 (2020)."},{"key":"e_1_3_2_2_31_1","unstructured":"Guixiang Ma Nesreen K Ahmed Theodore L Willke Dipanjan Sengupta Michael W Cole Nicholas B Turk-Browne and Philip S Yu. 2019 b. Deep graph similarity learning for brain data analysis. In CIKM. 2743--2751. Guixiang Ma Nesreen K Ahmed Theodore L Willke Dipanjan Sengupta Michael W Cole Nicholas B Turk-Browne and Philip S Yu. 2019 b. Deep graph similarity learning for brain data analysis. In CIKM. 2743--2751."},{"key":"e_1_3_2_2_32_1","volume-title":"2019 a. Deep Graph Similarity Learning: A Survey. arXiv:1912.11615","author":"Ma Guixiang","year":"2019","unstructured":"Guixiang Ma , Nesreen K Ahmed , Theodore L Willke , and Philip S Yu . 2019 a. Deep Graph Similarity Learning: A Survey. arXiv:1912.11615 ( 2019 ). Guixiang Ma, Nesreen K Ahmed, Theodore L Willke, and Philip S Yu. 2019 a. Deep Graph Similarity Learning: A Survey. arXiv:1912.11615 (2019)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Yao Ma Suhang Wang Charu C Aggarwal and Jiliang Tang. 2019 c. Graph convolutional networks with eigenpooling. In SIGKDD. 723--731. Yao Ma Suhang Wang Charu C Aggarwal and Jiliang Tang. 2019 c. Graph convolutional networks with eigenpooling. In SIGKDD. 723--731.","DOI":"10.1145\/3292500.3330982"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Jonas Mueller and Aditya Thyagarajan. 2016. Siamese recurrent architectures for learning sentence similarity. In AAAI. Jonas Mueller and Aditya Thyagarajan. 2016. Siamese recurrent architectures for learning sentence similarity. In AAAI.","DOI":"10.1609\/aaai.v30i1.10350"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Michel Neuhaus Kaspar Riesen and Horst Bunke. 2006. Fast suboptimal algorithms for the computation of graph edit distance. In SSPR. 163--172. Michel Neuhaus Kaspar Riesen and Horst Bunke. 2006. Fast suboptimal algorithms for the computation of graph edit distance. In SSPR. 163--172.","DOI":"10.1007\/11815921_17"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Giannis Nikolentzos Polykarpos Meladianos and Michalis Vazirgiannis. 2017. Matching node embeddings for graph similarity. In AAAI. Giannis Nikolentzos Polykarpos Meladianos and Michalis Vazirgiannis. 2017. Matching node embeddings for graph similarity. In AAAI.","DOI":"10.1609\/aaai.v31i1.10839"},{"key":"e_1_3_2_2_38_1","volume-title":"Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing","author":"Riesen Kaspar","year":"2009","unstructured":"Kaspar Riesen and Horst Bunke . 2009. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing , Vol. 27 , 7 ( 2009 ), 950--959. Kaspar Riesen and Horst Bunke. 2009. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing, Vol. 27, 7 (2009), 950--959."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_15"},{"key":"e_1_3_2_2_40_1","unstructured":"Richard Socher Danqi Chen Christopher D Manning and Andrew Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In NIPS. 926--934. Richard Socher Danqi Chen Christopher D Manning and Andrew Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In NIPS. 926--934."},{"key":"e_1_3_2_2_41_1","volume-title":"The proof and measurement of association between two things. The American journal of psychology","author":"Spearman Charles","year":"1987","unstructured":"Charles Spearman . 1987. The proof and measurement of association between two things. The American journal of psychology , Vol. 100 , 3\/4 ( 1987 ), 441--471. Charles Spearman. 1987. The proof and measurement of association between two things. The American journal of psychology, Vol. 100, 3\/4 (1987), 441--471."},{"key":"e_1_3_2_2_42_1","volume-title":"Sugar: Subgraph neural network with reinforcement pooling and self-supervised mutual information mechanism. arXiv preprint arXiv:2101.08170","author":"Sun Qingyun","year":"2021","unstructured":"Qingyun Sun , Jianxin Li , Hao Peng , Jia Wu , Yuanxing Ning , Phillip S Yu , and Lifang He . 2021 . Sugar: Subgraph neural network with reinforcement pooling and self-supervised mutual information mechanism. arXiv preprint arXiv:2101.08170 (2021). Qingyun Sun, Jianxin Li, Hao Peng, Jia Wu, Yuanxing Ning, Phillip S Yu, and Lifang He. 2021. Sugar: Subgraph neural network with reinforcement pooling and self-supervised mutual information mechanism. arXiv preprint arXiv:2101.08170 (2021)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Rahul Rama Varior Mrinal Haloi and Gang Wang. 2016. Gated siamese convolutional neural network architecture for human re-identification. In ECCV. 791--808. Rahul Rama Varior Mrinal Haloi and Gang Wang. 2016. Gated siamese convolutional neural network architecture for human re-identification. In ECCV. 791--808.","DOI":"10.1007\/978-3-319-46484-8_48"},{"key":"e_1_3_2_2_44_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In NIPS. 5998--6008. Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In NIPS. 5998--6008."},{"key":"e_1_3_2_2_45_1","volume-title":"Graph attention networks. arXiv:1710.10903","author":"Petar Velivc","year":"2017","unstructured":"Petar Velivc kovi\u0107, Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2017. Graph attention networks. arXiv:1710.10903 ( 2017 ). Petar Velivc kovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Shen Wang Zhengzhang Chen Xiao Yu Ding Li Jingchao Ni Lu-An Tang Jiaping Gui Zhichun Li Haifeng Chen and S Yu Philip. 2019. Heterogeneous Graph Matching Networks for Unknown Malware Detection.. In IJCAI. 3762--3770. Shen Wang Zhengzhang Chen Xiao Yu Ding Li Jingchao Ni Lu-An Tang Jiaping Gui Zhichun Li Haifeng Chen and S Yu Philip. 2019. Heterogeneous Graph Matching Networks for Unknown Malware Detection.. In IJCAI. 3762--3770.","DOI":"10.24963\/ijcai.2019\/522"},{"key":"e_1_3_2_2_47_1","volume-title":"et almbox","author":"Wasserman Stanley","year":"1994","unstructured":"Stanley Wasserman , Katherine Faust , et almbox . 1994 . Social network analysis: Methods and applications. Vol. 8 . Stanley Wasserman, Katherine Faust, et almbox. 1994. Social network analysis: Methods and applications. Vol. 8."},{"key":"e_1_3_2_2_48_1","volume-title":"2020 a. Hierarchical and Fast Graph Similarity Computation via Graph Coarsening and Deep Graph Learning. arXiv:2005.07115","author":"Xu Haoyan","year":"2020","unstructured":"Haoyan Xu , Runjian Chen , Yunsheng Bai , Jie Feng , Ziheng Duan , Ke Luo , Yizhou Sun , and Wei Wang . 2020 a. Hierarchical and Fast Graph Similarity Computation via Graph Coarsening and Deep Graph Learning. arXiv:2005.07115 ( 2020 ). Haoyan Xu, Runjian Chen, Yunsheng Bai, Jie Feng, Ziheng Duan, Ke Luo, Yizhou Sun, and Wei Wang. 2020 a. Hierarchical and Fast Graph Similarity Computation via Graph Coarsening and Deep Graph Learning. arXiv:2005.07115 (2020)."},{"key":"e_1_3_2_2_49_1","volume-title":"2020 b. Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation. arXiv:2005.08008","author":"Xu Haoyan","year":"2020","unstructured":"Haoyan Xu , Ziheng Duan , Jie Feng , Runjian Chen , Yida Huang , and Yueyang Wang . 2020 b. Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation. arXiv:2005.08008 ( 2020 ). Haoyan Xu, Ziheng Duan, Jie Feng, Runjian Chen, Yida Huang, and Yueyang Wang. 2020 b. Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation. arXiv:2005.08008 (2020)."},{"key":"e_1_3_2_2_50_1","unstructured":"Keyulu Xu Chengtao Li Yonglong Tian Tomohiro Sonobe Ken-ichi Kawarabayashi and Stefanie Jegelka. 2018. Representation Learning on Graphs with Jumping Knowledge Networks. In ICML. 5453--5462. Keyulu Xu Chengtao Li Yonglong Tian Tomohiro Sonobe Ken-ichi Kawarabayashi and Stefanie Jegelka. 2018. Representation Learning on Graphs with Jumping Knowledge Networks. In ICML. 5453--5462."},{"key":"e_1_3_2_2_51_1","volume-title":"Cross-lingual knowledge graph alignment via graph matching neural network. arXiv:1905.11605","author":"Xu Kun","year":"2019","unstructured":"Kun Xu , Liwei Wang , Mo Yu , Yansong Feng , Yan Song , Zhiguo Wang , and Dong Yu. 2019. Cross-lingual knowledge graph alignment via graph matching neural network. arXiv:1905.11605 ( 2019 ). Kun Xu, Liwei Wang, Mo Yu, Yansong Feng, Yan Song, Zhiguo Wang, and Dong Yu. 2019. Cross-lingual knowledge graph alignment via graph matching neural network. arXiv:1905.11605 (2019)."},{"key":"e_1_3_2_2_52_1","unstructured":"Xiaojun Xu Chang Liu Qian Feng Heng Yin Le Song and Dawn Song. 2017. Neural network-based graph embedding for cross-platform binary code similarity detection. In SIGSAC. 363--376. Xiaojun Xu Chang Liu Qian Feng Heng Yin Le Song and Dawn Song. 2017. Neural network-based graph embedding for cross-platform binary code similarity detection. In SIGSAC. 363--376."},{"key":"e_1_3_2_2_53_1","volume-title":"Hypergcn: A new method for training graph convolutional networks on hypergraphs. In NIPS. 1511--1522.","author":"Yadati Naganand","year":"2019","unstructured":"Naganand Yadati , Madhav Nimishakavi , Prateek Yadav , Vikram Nitin , Anand Louis , and Partha Talukdar . 2019 . Hypergcn: A new method for training graph convolutional networks on hypergraphs. In NIPS. 1511--1522. Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Vikram Nitin, Anand Louis, and Partha Talukdar. 2019. Hypergcn: A new method for training graph convolutional networks on hypergraphs. In NIPS. 1511--1522."},{"key":"e_1_3_2_2_54_1","volume-title":"Adaptive discrete hypergraph matching","author":"Yan Junchi","year":"2017","unstructured":"Junchi Yan , Changsheng Li , Yin Li , and Guitao Cao . 2017. Adaptive discrete hypergraph matching . IEEE transactions on cybernetics, Vol. 48 ( 2017 ), 765--779. Junchi Yan, Changsheng Li, Yin Li, and Guitao Cao. 2017. Adaptive discrete hypergraph matching. IEEE transactions on cybernetics, Vol. 48 (2017), 765--779."},{"key":"e_1_3_2_2_55_1","volume-title":"gspan: Graph-based substructure pattern mining","author":"Yan Xifeng","unstructured":"Xifeng Yan and Jiawei Han . 2002. gspan: Graph-based substructure pattern mining . In ICDM. IEEE , 721--724. Xifeng Yan and Jiawei Han. 2002. gspan: Graph-based substructure pattern mining. In ICDM. IEEE, 721--724."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Pinar Yanardag and SVN Vishwanathan. 2015. Deep graph kernels. In SIGKDD. 1365--1374. Pinar Yanardag and SVN Vishwanathan. 2015. Deep graph kernels. In SIGKDD. 1365--1374.","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018a. Graph convolutional neural networks for web-scale recommender systems. In SIGKDD. 974--983. Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018a. Graph convolutional neural networks for web-scale recommender systems. In SIGKDD. 974--983.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_58_1","unstructured":"Zhitao Ying Jiaxuan You Christopher Morris Xiang Ren Will Hamilton and Jure Leskovec. 2018b. Hierarchical graph representation learning with differentiable pooling. In NIPS. 4800--4810. Zhitao Ying Jiaxuan You Christopher Morris Xiang Ren Will Hamilton and Jure Leskovec. 2018b. Hierarchical graph representation learning with differentiable pooling. In NIPS. 4800--4810."},{"key":"e_1_3_2_2_59_1","unstructured":"Jiaxuan You Bowen Liu Zhitao Ying Vijay Pande and Jure Leskovec. 2018. Graph convolutional policy network for goal-directed molecular graph generation. In NIPS. 6410--6421. Jiaxuan You Bowen Liu Zhitao Ying Vijay Pande and Jure Leskovec. 2018. Graph convolutional policy network for goal-directed molecular graph generation. In NIPS. 6410--6421."},{"key":"e_1_3_2_2_60_1","first-page":"25","article-title":"Comparing stars: On approximating graph edit distance","volume":"2","author":"Zeng Zhiping","year":"2009","unstructured":"Zhiping Zeng , Anthony KH Tung , Jianyong Wang , Jianhua Feng , and Lizhu Zhou . 2009 . Comparing stars: On approximating graph edit distance . VLDB , Vol. 2 , 1 (2009), 25 -- 36 . Zhiping Zeng, Anthony KH Tung, Jianyong Wang, Jianhua Feng, and Lizhu Zhou. 2009. Comparing stars: On approximating graph edit distance. VLDB, Vol. 2, 1 (2009), 25--36.","journal-title":"VLDB"},{"key":"e_1_3_2_2_61_1","volume-title":"2019 b. Hyper-SAGNN: a self-attention based graph neural network for hypergraphs. arXiv:1911.02613","author":"Zhang Ruochi","year":"2019","unstructured":"Ruochi Zhang , Yuesong Zou , and Jian Ma . 2019 b. Hyper-SAGNN: a self-attention based graph neural network for hypergraphs. arXiv:1911.02613 ( 2019 ). Ruochi Zhang, Yuesong Zou, and Jian Ma. 2019 b. Hyper-SAGNN: a self-attention based graph neural network for hypergraphs. arXiv:1911.02613 (2019)."},{"key":"e_1_3_2_2_62_1","volume-title":"2019 a. Hierarchical graph pooling with structure learning. arXiv:1911.05954","author":"Zhang Zhen","year":"2019","unstructured":"Zhen Zhang , Jiajun Bu , Martin Ester , Jianfeng Zhang , Chengwei Yao , Zhi Yu , and Can Wang . 2019 a. Hierarchical graph pooling with structure learning. arXiv:1911.05954 ( 2019 ). Zhen Zhang, Jiajun Bu, Martin Ester, Jianfeng Zhang, Chengwei Yao, Zhi Yu, and Can Wang. 2019 a. Hierarchical graph pooling with structure learning. arXiv:1911.05954 (2019)."},{"key":"e_1_3_2_2_63_1","first-page":"3155","article-title":"ANRL: Attributed Network Representation Learning via Deep Neural Networks","volume":"18","author":"Zhang Zhen","year":"2018","unstructured":"Zhen Zhang , Hongxia Yang , Jiajun Bu , Sheng Zhou , Pinggang Yu , Jianwei Zhang , Martin Ester , and Can Wang . 2018 . ANRL: Attributed Network Representation Learning via Deep Neural Networks .. In IJCAI , Vol. 18. 3155 -- 3161 . Zhen Zhang, Hongxia Yang, Jiajun Bu, Sheng Zhou, Pinggang Yu, Jianwei Zhang, Martin Ester, and Can Wang. 2018. ANRL: Attributed Network Representation Learning via Deep Neural Networks.. In IJCAI, Vol. 18. 3155--3161.","journal-title":"IJCAI"},{"key":"e_1_3_2_2_64_1","volume-title":"Learning to map social network users by unified manifold alignment on hypergraph. TNNLS","author":"Zhao Wei","year":"2018","unstructured":"Wei Zhao , Shulong Tan , Ziyu Guan , Boxuan Zhang , Maoguo Gong , Zhengwen Cao , and Quan Wang . 2018. Learning to map social network users by unified manifold alignment on hypergraph. TNNLS ( 2018 ), 5834--5846. Wei Zhao, Shulong Tan, Ziyu Guan, Boxuan Zhang, Maoguo Gong, Zhengwen Cao, and Quan Wang. 2018. Learning to map social network users by unified manifold alignment on hypergraph. TNNLS (2018), 5834--5846."},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2007. Learning with hypergraphs: Clustering classification and embedding. In NIPS. 1601--1608. Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2007. Learning with hypergraphs: Clustering classification and embedding. In NIPS. 1601--1608.","DOI":"10.7551\/mitpress\/7503.003.0205"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:22Z","timestamp":1750191502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467328"}},"subtitle":["Graph Similarity Learning with Hierarchical Hypergraph Matching Networks"],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":64,"alternative-id":["10.1145\/3447548.3467328","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467328","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}