{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:41:31Z","timestamp":1770817291696,"version":"3.50.1"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T00:00:00Z","timestamp":1704672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ARC Future Fellowship","award":["FT210100097"],"award-info":[{"award-number":["FT210100097"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272340, 62276187"],"award-info":[{"award-number":["62272340, 62276187"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>\n            Graph similarity learning is a significant and fundamental issue in the theory and analysis of graphs, which has been applied in a variety of fields, including object tracking, recommender systems, similarity search, and so on. Recent methods for graph similarity learning that utilize deep learning typically share two deficiencies: (1) they leverage graph neural networks as backbones for learning graph representations but have not well captured the complex information inside data, and (2) they employ a cross-graph attention mechanism for graph similarity learning, which is computationally expensive. Taking these limitations into consideration, a method for graph similarity learning is devised in this study, namely, Contrastive Graph Similarity Network (CGSim). To enhance graph similarity learning, CGSim makes use of the complementary information of two input graphs and captures pairwise relations in a contrastive learning framework. By developing a dual contrastive learning module with a\n            <jats:italic>node-graph matching<\/jats:italic>\n            and a\n            <jats:italic>graph-graph matching<\/jats:italic>\n            mechanism, our method significantly reduces the quadratic time complexity for cross-graph interaction modeling to linear time complexity. Jointly learning in an end-to-end framework, the graph representation embedding module and the well-designed contrastive learning module can be beneficial to one another. A comprehensive series of experiments indicate that CGSim outperforms state-of-the-art baselines on six datasets and significantly reduces the computational cost, which demonstrates our CGSim model\u2019s superiority over other baselines.\n          <\/jats:p>","DOI":"10.1145\/3580511","type":"journal-article","created":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T11:56:46Z","timestamp":1675079806000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Contrastive Graph Similarity Networks"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4131-7824","authenticated-orcid":false,"given":"Luzhi","family":"Wang","sequence":"first","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3540-8845","authenticated-orcid":false,"given":"Yizhen","family":"Zheng","sequence":"additional","affiliation":[{"name":"Department of Data Science and AI, Faculty of IT, Monash University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7445-9936","authenticated-orcid":false,"given":"Di","family":"Jin","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5216-3213","authenticated-orcid":false,"given":"Fuyi","family":"Li","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Northwest A&amp;F University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2142-0154","authenticated-orcid":false,"given":"Yongliang","family":"Qiao","sequence":"additional","affiliation":[{"name":"Australian Centre for Field Robotics, The University of Sydney, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0794-527X","authenticated-orcid":false,"given":"Shirui","family":"Pan","sequence":"additional","affiliation":[{"name":"School of Information and Communication Technology, Griffith University, Australia"}]}],"member":"320","published-online":{"date-parts":[[2024,1,8]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313668"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5720"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001493000339"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1093\/database\/baaa078"},{"key":"e_1_3_1_7_2","first-page":"1597","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Chen Ting","year":"2020","unstructured":"Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In Proceedings of the International Conference on Machine Learning. PMLR, 1597\u20131607."},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.10.027"},{"issue":"9","key":"e_1_3_1_9_2","first-page":"5541","article-title":"Siamese network for RGB-D salient object detection and beyond","volume":"44","author":"Fu Keren","year":"2021","unstructured":"Keren Fu, Deng-Ping Fan, Ge-Peng Ji, Qijun Zhao, Jianbing Shen, and Ce Zhu. 2021. Siamese network for RGB-D salient object detection and beyond. IEEE Trans. Pattern Anal. Mach. Intell. 44, 9 (2021), 5541\u20135559.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"e_1_3_1_10_2","article-title":"SimCSE: Simple contrastive learning of sentence embeddings","author":"Gao Tianyu","year":"2021","unstructured":"Tianyu Gao, Xingcheng Yao, and Danqi Chen. 2021. SimCSE: Simple contrastive learning of sentence embeddings. Retrieved from https:\/\/arXiv:2104.08821.","journal-title":"Retrieved from"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.138"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/11551188_9"},{"key":"e_1_3_1_13_2","article-title":"Bootstrap your own latent: A new approach to self-supervised learning","author":"Grill Jean-Bastien","year":"2020","unstructured":"Jean-Bastien Grill, Florian Strub, Florent Altch\u00e9, Corentin Tallec, Pierre H. Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhaohan Daniel Guo, Mohammad Gheshlaghi Azar et\u00a0al. 2020. Bootstrap your own latent: A new approach to self-supervised learning. Retrieved from https:\/\/arXiv:2006.07733.","journal-title":"Retrieved from"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/1024022"},{"key":"e_1_3_1_15_2","first-page":"4116","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Hassani Kaveh","year":"2020","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In Proceedings of the International Conference on Machine Learning. PMLR, 4116\u20134126."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"e_1_3_1_17_2","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/ICPR.2002.1047427","volume-title":"Object Recognition Supported by User Interaction for Service Robots","author":"Hlaoui Adel","year":"2002","unstructured":"Adel Hlaoui and Shengrui Wang. 2002. A new algorithm for inexact graph matching. In Object Recognition Supported by User Interaction for Service Robots, Vol. 4. IEEE, 180\u2013183."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.07.021"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449914"},{"key":"e_1_3_1_20_2","article-title":"CGMN: A contrastive graph matching network for self-supervised graph similarity learning","author":"Jin Di","year":"2022","unstructured":"Di Jin, Luzhi Wang, Yizhen Zheng, Xiang Li, Fei Jiang, Wei Lin, and Shirui Pan. 2022. CGMN: A contrastive graph matching network for self-supervised graph similarity learning. Retrieved from https:\/\/arXiv:2205.15083.","journal-title":"Retrieved from"},{"key":"e_1_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Di Jin Zhizhi Yu Pengfei Jiao Shirui Pan Philip S. Yu and Weixiong Zhang. 2021. A survey of community detection approaches: From statistical modeling to deep learning. Retrieved from https:\/\/arxiv.org\/abs\/2101.01669.","DOI":"10.1109\/TKDE.2021.3104155"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/204"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2018.00019"},{"key":"e_1_3_1_24_2","article-title":"Supervised contrastive learning","author":"Khosla Prannay","year":"2020","unstructured":"Prannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna, Yonglong Tian, Phillip Isola, Aaron Maschinot, Ce Liu, and Dilip Krishnan. 2020. Supervised contrastive learning. Retrieved from https:\/\/arXiv:2004.11362.","journal-title":"Retrieved from"},{"key":"e_1_3_1_25_2","volume-title":"Proceedings of the 5th International Conference on Learning Representations (ICLR\u201917)","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the 5th International Conference on Learning Representations (ICLR\u201917). OpenReview.net. Retrieved from https:\/\/openreview.net\/forum?id=SJU4ayYgl."},{"key":"e_1_3_1_26_2","volume-title":"Proc. Ecol. Inference Conf.","author":"Koutra Danai","year":"2011","unstructured":"Danai Koutra, Ankur Parikh, Aaditya Ramdas, and Jing Xiang. 2011. Algorithms for graph similarity and subgraph matching. In Proc. Ecol. Inference Conf., Vol. 17."},{"key":"e_1_3_1_27_2","first-page":"3835","volume-title":"Proceedings of the 36th International Conference on Machine Learning (ICML\u201919) (Proceedings of Machine Learning Research)","volume":"97","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 Proceedings of the 36th International Conference on Machine Learning (ICML\u201919) (Proceedings of Machine Learning Research), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.), Vol. 97. PMLR, 3835\u20133845. Retrieved from http:\/\/proceedings.mlr.press\/v97\/li19d.html."},{"key":"e_1_3_1_28_2","volume-title":"Proceedings of the 4th International Conference on Learning Representations (ICLR\u201916)","author":"Li Yujia","year":"2016","unstructured":"Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard S. Zemel. 2016. Gated graph sequence neural networks. In Proceedings of the 4th International Conference on Learning Representations (ICLR\u201916), Yoshua Bengio and Yann LeCun (Eds.). Retrieved from http:\/\/arxiv.org\/abs\/1511.05493."},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3102234"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068344"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00733-5"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357815"},{"key":"e_1_3_1_33_2","first-page":"3111","volume-title":"Advances in Neural Information Processing Systems","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S. Corrado, and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In Advances in Neural Information Processing Systems. MIT Press, 3111\u20133119."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-010-0003-x"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_1_38_2","volume-title":"Proceedings of the 6th International Conference on Learning Representations (ICLR\u201918)","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In Proceedings of the 6th International Conference on Learning Representations (ICLR\u201918). OpenReview.net. Retrieved from https:\/\/openreview.net\/forum?id=rJXMpikCZ."},{"key":"e_1_3_1_39_2","article-title":"Deep graph infomax. In","author":"Velickovic Petar","year":"2019","unstructured":"Petar Velickovic, William Fedus, William L. Hamilton, Pietro Li\u00f2, Yoshua Bengio, and R. Devon Hjelm. 2019. Deep graph infomax. In Proceedings of the International Conference on Learning Representations (ICLR\u201919).","journal-title":"Proceedings of the International Conference on Learning Representations (ICLR\u201919)"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00315"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3005590"},{"key":"e_1_3_1_42_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems (NeurIPS\u201920)","author":"Wang Runzhong","year":"2020","unstructured":"Runzhong Wang, Junchi Yan, and Xiaokang Yang. 2020. Graduated assignment for joint multi-graph matching and clustering with application to unsupervised graph matching network learning. In Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems (NeurIPS\u201920), Hugo Larochelle, Marc\u2019Aurelio Ranzato, Raia Hadsell, Maria-Florina Balcan, and Hsuan-Tien Lin (Eds.). Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/e6384711491713d29bc63fc5eeb5ba4f-Abstract.html."},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3156044"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3186016"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3186103"},{"key":"e_1_3_1_46_2","volume-title":"Proceedings of the 7th International Conference on Learning Representations (ICLR\u201919)","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How powerful are graph neural networks? In Proceedings of the 7th International Conference on Learning Representations (ICLR\u201919). OpenReview.net. Retrieved from https:\/\/openreview.net\/forum?id=ryGs6iA5Km."},{"key":"e_1_3_1_47_2","article-title":"Cross-lingual knowledge graph alignment via graph matching neural network","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. Retrieved from https:\/\/arXiv:1905.11605.","journal-title":"Retrieved from"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134018"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_1_50_2","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. Adv. Neural Info. Process. Syst. 33 (2020), 5812\u20135823.","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_1_51_2","volume-title":"Proceedings of the 8th International Conference on Learning Representations (ICLR\u201920)","author":"Yu Tianshu","year":"2020","unstructured":"Tianshu Yu, Runzhong Wang, Junchi Yan, and Baoxin Li. 2020. Learning deep graph matching with channel-independent embedding and Hungarian attention. In Proceedings of the 8th International Conference on Learning Representations (ICLR\u201920). OpenReview.net. Retrieved from https:\/\/openreview.net\/forum?id=rJgBd2NYPH."},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00095"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2007.01.006"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00284"},{"key":"e_1_3_1_55_2","first-page":"12310","volume-title":"Proceedings of the 38th International Conference on Machine Learning (ICML\u201921) (Proceedings of Machine Learning Research)","volume":"139","author":"Zbontar Jure","year":"2021","unstructured":"Jure Zbontar, Li Jing, Ishan Misra, Yann LeCun, and St\u00e9phane Deny. 2021. Barlow twins: Self-supervised learning via redundancy reduction. In Proceedings of the 38th International Conference on Machine Learning (ICML\u201921) (Proceedings of Machine Learning Research), Marina Meila and Tong Zhang (Eds.), Vol. 139. PMLR, 12310\u201312320. Retrieved from http:\/\/proceedings.mlr.press\/v139\/zbontar21a.html."},{"key":"e_1_3_1_56_2","article-title":"Trustworthy graph neural networks: Aspects, methods and trends","author":"Zhang He","year":"2022","unstructured":"He Zhang, Bang Wu, Xingliang Yuan, Shirui Pan, Hanghang Tong, and Jian Pei. 2022. Trustworthy graph neural networks: Aspects, methods and trends. Retrieved from https:\/\/arXiv:2205.07424.","journal-title":"Retrieved from"},{"key":"e_1_3_1_57_2","unstructured":"Yizhen Zheng Shirui Pan Vincent Cs Lee Yu Zheng and Philip S. Yu. 2022. Rethinking and scaling up graph contrastive learning: An extremely efficient approach with group discrimination. Retrieved from https:\/\/arXiv:2206.01535."},{"key":"e_1_3_1_58_2","article-title":"Unifying graph contrastive learning with flexible contextual scopes","author":"Zheng Yizhen","year":"2022","unstructured":"Yizhen Zheng, Yu Zheng, Xiaofei Zhou, Chen Gong, Vincent Lee, and Shirui Pan. 2022. Unifying graph contrastive learning with flexible contextual scopes. Retrieved from https:\/\/arXiv:2210.08792.","journal-title":"Retrieved from"},{"key":"e_1_3_1_59_2","first-page":"127","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","author":"Zhou Feng","year":"2012","unstructured":"Feng Zhou and Fernando De la Torre. 2012. Factorized graph matching. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 127\u2013134."},{"key":"e_1_3_1_60_2","volume-title":"Proceedings of the 37th International Conference on Machine Learning Workshop on Graph Representation Learning and Beyond","author":"Zhu Yanqiao","year":"2020","unstructured":"Yanqiao Zhu, Yichen Xu, Feng Yu, Qiang Liu, Shu Wu, and Liang Wang. 2020. Deep graph contrastive representation learning. In Proceedings of the 37th International Conference on Machine Learning Workshop on Graph Representation Learning and Beyond."}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:35Z","timestamp":1750178795000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,8]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3580511"],"URL":"https:\/\/doi.org\/10.1145\/3580511","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"value":"1559-1131","type":"print"},{"value":"1559-114X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,8]]},"assertion":[{"value":"2022-01-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-20","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}