{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:33Z","timestamp":1750220253845,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T00:00:00Z","timestamp":1642204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2020YFC0833302"],"award-info":[{"award-number":["No.2020YFC0833302"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,1,15]]},"DOI":"10.1145\/3523150.3523157","type":"proceedings-article","created":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T21:39:55Z","timestamp":1649885995000},"page":"39-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["DGE-GSIM: A multi-task dual graph embedding learning for graph similarity computation"],"prefix":"10.1145","author":[{"given":"Wenhui","family":"Tan","sequence":"first","affiliation":[{"name":"Northeastern University, China"}]},{"given":"Peng","family":"Cao","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}]},{"given":"Zhiyong","family":"Jin","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}]},{"given":"Futao","family":"Luo","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}]},{"given":"Guangqi","family":"Wen","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}]},{"given":"Weiping","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University, China"}]}],"member":"320","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20844-7_11"},{"key":"e_1_3_2_2_4_1","unstructured":"Matthias Fey and Jan\u00a0Eric Lenssen. 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428(2019).  Matthias Fey and Jan\u00a0Eric Lenssen. 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428(2019)."},{"key":"e_1_3_2_2_5_1","volume-title":"Some properties of line digraphs. Rendiconti del circolo matematico di palermo 9, 2","author":"Harary Frank","year":"1960","unstructured":"Frank Harary and Robert\u00a0 Z Norman . 1960. Some properties of line digraphs. Rendiconti del circolo matematico di palermo 9, 2 ( 1960 ), 161\u2013168. Frank Harary and Robert\u00a0Z Norman. 1960. Some properties of line digraphs. Rendiconti del circolo matematico di palermo 9, 2 (1960), 161\u2013168."},{"key":"e_1_3_2_2_6_1","volume-title":"Long short-term memory. Neural computation 9, 8","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber . 1997. Long short-term memory. Neural computation 9, 8 ( 1997 ), 1735\u20131780. Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9, 8 (1997), 1735\u20131780."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Xiaodong Jiang Pengsheng Ji and Sheng Li. 2019. CensNet: Convolution with Edge-Node Switching in Graph Neural Networks.. In IJCAI. 2656\u20132662.  Xiaodong Jiang Pengsheng Ji and Sheng Li. 2019. CensNet: Convolution with Edge-Node Switching in Graph Neural Networks.. In IJCAI. 2656\u20132662.","DOI":"10.24963\/ijcai.2019\/369"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"e_1_3_2_2_9_1","volume-title":"ICLR: International Conference on Learning Representations. 1\u201315","author":"Kingma P","year":"2015","unstructured":"Diederik\u00a0 P Kingma and Jimmy\u00a0Lei Ba . 2015 . Adam: A method for stochastic gradient descent . In ICLR: International Conference on Learning Representations. 1\u201315 . Diederik\u00a0P Kingma and Jimmy\u00a0Lei Ba. 2015. Adam: A method for stochastic gradient descent. In ICLR: International Conference on Learning Representations. 1\u201315."},{"key":"e_1_3_2_2_10_1","volume-title":"International conference on machine learning. PMLR, 3835\u20133845","author":"Li Yujia","year":"2019","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 International conference on machine learning. PMLR, 3835\u20133845 . Yujia Li, Chenjie Gu, Thomas Dullien, Oriol Vinyals, and Pushmeet Kohli. 2019. Graph matching networks for learning the similarity of graph structured objects. In International conference on machine learning. PMLR, 3835\u20133845."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3102234"},{"key":"e_1_3_2_2_12_1","unstructured":"Xiang Ling Lingfei Wu Saizhuo Wang Tengfei Ma Fangli Xu Chunming Wu and Shouling Ji. 2019. Hierarchical graph matching networks for deep graph similarity learning. (2019).  Xiang Ling Lingfei Wu Saizhuo Wang Tengfei Ma Fangli Xu Chunming Wu and Shouling Ji. 2019. Hierarchical graph matching networks for deep graph similarity learning. (2019)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/K16-1006"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.433"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11815921_17"},{"key":"e_1_3_2_2_17_1","volume-title":"Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke , Sam Gross , Francisco Massa , Adam Lerer , James Bradbury , Gregory Chanan , Trevor Killeen , Zeming Lin , Natalia Gimelshein , Luca Antiga , 2019 . Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019), 8026\u20138037. Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, 2019. Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019), 8026\u20138037."},{"key":"e_1_3_2_2_18_1","volume-title":"Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing 27, 7","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 27, 7 ( 2009 ), 950\u2013959. Kaspar Riesen and Horst Bunke. 2009. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing 27, 7 (2009), 950\u2013959."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_15"},{"key":"e_1_3_2_2_20_1","volume-title":"The graph neural network model","author":"Scarselli Franco","year":"2008","unstructured":"Franco Scarselli , Marco Gori , Ah\u00a0Chung Tsoi , Markus Hagenbuchner , and Gabriele Monfardini . 2008. The graph neural network model . IEEE transactions on neural networks 20, 1 ( 2008 ), 61\u201380. Franco Scarselli, Marco Gori, Ah\u00a0Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2008. The graph neural network model. IEEE transactions on neural networks 20, 1 (2008), 61\u201380."},{"key":"e_1_3_2_2_21_1","unstructured":"Richard Socher Danqi Chen Christopher\u00a0D Manning and Andrew Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In Advances in neural information processing systems. 926\u2013934.  Richard Socher Danqi Chen Christopher\u00a0D Manning and Andrew Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In Advances in neural information processing systems. 926\u2013934."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/1412159"},{"key":"e_1_3_2_2_23_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan\u00a0N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems. 5998\u20136008.  Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan\u00a0N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems. 5998\u20136008."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.28"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_2_26_1","volume-title":"2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 721\u2013724","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han . 2002 . gspan: Graph-based substructure pattern mining . In 2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 721\u2013724 . Xifeng Yan and Jiawei Han. 2002. gspan: Graph-based substructure pattern mining. In 2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 721\u2013724."}],"event":{"name":"ICMLSC 2022: 2022 The 6th International Conference on Machine Learning and Soft Computing","acronym":"ICMLSC 2022","location":"Haikou China"},"container-title":["2022 The 6th International Conference on Machine Learning and Soft Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3523150.3523157","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3523150.3523157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:43Z","timestamp":1750188643000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3523150.3523157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,15]]},"references-count":26,"alternative-id":["10.1145\/3523150.3523157","10.1145\/3523150"],"URL":"https:\/\/doi.org\/10.1145\/3523150.3523157","relation":{},"subject":[],"published":{"date-parts":[[2022,1,15]]},"assertion":[{"value":"2022-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}