{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:14Z","timestamp":1750309334732,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-2406647, NSF-2406648"],"award-info":[{"award-number":["NSF-2406647, NSF-2406648"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671898","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"456-465","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Contrastive Learning on Graphs with Node Similarity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8483-3943","authenticated-orcid":false,"given":"Hongliang","family":"Chi","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4985-8724","authenticated-orcid":false,"given":"Yao","family":"Ma","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/002068970500044749"},{"key":"e_1_3_2_2_2_1","volume-title":"A theoretical analysis of contrastive unsupervised representation learning. arXiv preprint arXiv:1902.09229","author":"Arora Sanjeev","year":"2019","unstructured":"Sanjeev Arora, Hrishikesh Khandeparkar, Mikhail Khodak, Orestis Plevrakis, and Nikunj Saunshi. 2019. A theoretical analysis of contrastive unsupervised representation learning. arXiv preprint arXiv:1902.09229 (2019)."},{"key":"e_1_3_2_2_3_1","volume-title":"Learning representations by maximizing mutual information across views. NeurIPS","author":"Bachman Philip","year":"2019","unstructured":"Philip Bachman, R Devon Hjelm, and William Buchwalter. 2019. Learning representations by maximizing mutual information across views. NeurIPS (2019)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109631"},{"key":"e_1_3_2_2_5_1","unstructured":"Ting Chen Simon Kornblith Mohammad Norouzi and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In ICML."},{"key":"e_1_3_2_2_6_1","volume-title":"NeurIPS","volume":"33","author":"Chuang Ching-Yao","year":"2020","unstructured":"Ching-Yao Chuang, Joshua Robinson, Yen-Chen Lin, Antonio Torralba, and Stefanie Jegelka. 2020. Debiased contrastive learning. NeurIPS, Vol. 33 (2020)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Debidatta Dwibedi Yusuf Aytar Jonathan Tompson Pierre Sermanet and Andrew Zisserman. 2021. With a little help from my friends: Nearest-neighbor contrastive learning of visual representations. In ICCV.","DOI":"10.1109\/ICCV48922.2021.00945"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Wenqi Fan Yao Ma Qing Li Yuan He Eric Zhao Jiliang Tang and Dawei Yin. 2019. Graph neural networks for social recommendation. In WWW.","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347011"},{"key":"e_1_3_2_2_10_1","volume-title":"Few-shot learning with graph neural networks. arXiv preprint arXiv:1711.04043","author":"Garcia Victor","year":"2017","unstructured":"Victor Garcia and Joan Bruna. 2017. Few-shot learning with graph neural networks. arXiv preprint arXiv:1711.04043 (2017)."},{"key":"e_1_3_2_2_11_1","volume-title":"Social network analysis: From graph theory to applications with python. arXiv preprint arXiv:2102.10014","author":"Goldenberg Dmitri","year":"2021","unstructured":"Dmitri Goldenberg. 2021. Social network analysis: From graph theory to applications with python. arXiv preprint arXiv:2102.10014 (2021)."},{"volume-title":"Deep Learning","author":"Goodfellow Ian","key":"e_1_3_2_2_12_1","unstructured":"Ian Goodfellow, Yoshua Bengio, and Aaron Courville. 2016. Deep Learning. MIT Press. http:\/\/www.deeplearningbook.org."},{"key":"e_1_3_2_2_13_1","volume-title":"Zhaohan Guo, Mohammad Gheshlaghi Azar, et al.","author":"Grill Jean-Bastien","year":"2020","unstructured":"Jean-Bastien Grill, Florian Strub, Florent Altch\u00e9, Corentin Tallec, Pierre Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhaohan Guo, Mohammad Gheshlaghi Azar, et al. 2020. Bootstrap your own latent-a new approach to self-supervised learning. NeurIPS, Vol. 33 (2020)."},{"key":"e_1_3_2_2_14_1","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In ICML."},{"key":"e_1_3_2_2_15_1","unstructured":"Kaiming He Haoqi Fan Yuxin Wu Saining Xie and Ross Girshick. 2020. Momentum contrast for unsupervised visual representation learning. In CVPR."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","unstructured":"Yang Hu Haoxuan You Zhecan Wang Zhicheng Wang Erjin Zhou and Yue Gao. 2021. Graph-MLP: Node Classification without Message Passing in Graph. https:\/\/doi.org\/10.48550\/ARXIV.2106.04051","DOI":"10.48550\/ARXIV.2106.04051"},{"key":"e_1_3_2_2_17_1","volume-title":"Multi-scale contrastive siamese networks for self-supervised graph representation learning. arXiv preprint arXiv:2105.05682","author":"Jin Ming","year":"2021","unstructured":"Ming Jin, Yizhen Zheng, Yuan-Fang Li, Chen Gong, Chuan Zhou, and Shirui Pan. 2021. Multi-scale contrastive siamese networks for self-supervised graph representation learning. arXiv preprint arXiv:2105.05682 (2021)."},{"key":"e_1_3_2_2_18_1","volume-title":"Self-supervised learning on graphs: Deep insights and new direction. arXiv preprint arXiv:2006.10141","author":"Jin Wei","year":"2020","unstructured":"Wei Jin, Tyler Derr, Haochen Liu, Yiqi Wang, Suhang Wang, Zitao Liu, and Jiliang Tang. 2020. Self-supervised learning on graphs: Deep insights and new direction. arXiv preprint arXiv:2006.10141 (2020)."},{"key":"e_1_3_2_2_19_1","first-page":"21798","article-title":"Hard negative mixing for contrastive learning","volume":"33","author":"Kalantidis Yannis","year":"2020","unstructured":"Yannis Kalantidis, Mert Bulent Sariyildiz, Noe Pion, Philippe Weinzaepfel, and Diane Larlus. 2020. Hard negative mixing for contrastive learning. NeurIPS, Vol. 33 (2020), 21798--21809.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_20_1","volume-title":"NeurIPS","volume":"33","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. NeurIPS, Vol. 33 (2020)."},{"key":"e_1_3_2_2_21_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint 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 preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_22_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint 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 preprint arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_2_23_1","volume-title":"Diffusion improves graph learning. arXiv preprint arXiv:1911.05485","author":"Klicpera Johannes","year":"2019","unstructured":"Johannes Klicpera, Stefan Wei\u00dfenberger, and Stephan G\u00fcnnemann. 2019. Diffusion improves graph learning. arXiv preprint arXiv:1911.05485 (2019)."},{"key":"e_1_3_2_2_24_1","volume-title":"PPR-SSM: personalized PageRank and semantic similarity measures for entity linking. BMC bioinformatics","author":"Lamurias Andre","year":"2019","unstructured":"Andre Lamurias, Pedro Ruas, and Francisco M Couto. 2019. PPR-SSM: personalized PageRank and semantic similarity measures for entity linking. BMC bioinformatics, Vol. 20, 1 (2019)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.drudis.2022.103373"},{"key":"e_1_3_2_2_26_1","volume-title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks. arXiv preprint arXiv:2007.02901","author":"Mernyei P\u00e9ter","year":"2020","unstructured":"P\u00e9ter Mernyei and Cuatualina Cangea. 2020. Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks. arXiv preprint arXiv:2007.02901 (2020)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20748"},{"key":"e_1_3_2_2_29_1","volume-title":"A survey on personalized PageRank computation algorithms. Access","author":"Park Sungchan","year":"2019","unstructured":"Sungchan Park, Wonseok Lee, Byeongseo Choe, and Sang-Goo Lee. 2019. A survey on personalized PageRank computation algorithms. Access (2019)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDAR.2019.00031"},{"key":"e_1_3_2_2_31_1","volume-title":"Practical high-quality electrostatic potential surfaces for drug discovery using a graph-convolutional deep neural network. Journal of medicinal chemistry","author":"Rathi Prakash Chandra","year":"2019","unstructured":"Prakash Chandra Rathi, R Frederick Ludlow, and Marcel L Verdonk. 2019. Practical high-quality electrostatic potential surfaces for drug discovery using a graph-convolutional deep neural network. Journal of medicinal chemistry (2019)."},{"key":"e_1_3_2_2_32_1","volume-title":"Contrastive learning with hard negative samples. arXiv preprint arXiv:2010.04592","author":"Robinson Joshua","year":"2020","unstructured":"Joshua Robinson, Ching-Yao Chuang, Suvrit Sra, and Stefanie Jegelka. 2020. Contrastive learning with hard negative samples. arXiv preprint arXiv:2010.04592 (2020)."},{"key":"e_1_3_2_2_33_1","volume-title":"Collective classification in network data. AI magazine","author":"Sen Prithviraj","year":"2008","unstructured":"Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine, Vol. 29, 3 (2008), 93--93."},{"key":"e_1_3_2_2_34_1","volume-title":"Short-term traffic forecasting: Modeling and learning spatio-temporal relations in transportation networks using graph neural networks","author":"Shahsavari Behrooz","year":"2015","unstructured":"Behrooz Shahsavari and Pieter Abbeel. 2015. Short-term traffic forecasting: Modeling and learning spatio-temporal relations in transportation networks using graph neural networks. University of California at Berkeley, Technical Report No. UCB\/EECS-2015--243 (2015)."},{"key":"e_1_3_2_2_35_1","volume-title":"Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018)."},{"key":"e_1_3_2_2_36_1","volume-title":"ICLR 2021 Workshop on GTRL.","author":"Thakoor Shantanu","year":"2021","unstructured":"Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, R\u00e9mi Munos, Petar Velivckovi\u0107, and Michal Valko. 2021. Bootstrapped representation learning on graphs. In ICLR 2021 Workshop on GTRL."},{"key":"e_1_3_2_2_37_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Velivckovi\u0107 Petar","year":"2017","unstructured":"Petar Velivckovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_38_1","first-page":"4","article-title":"Deep Graph Infomax","volume":"2","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. ICLR (Poster), Vol. 2, 3 (2019), 4.","journal-title":"ICLR (Poster)"},{"key":"e_1_3_2_2_39_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML. PMLR."},{"key":"e_1_3_2_2_40_1","volume-title":"Conditional negative sampling for contrastive learning of visual representations. arXiv preprint arXiv:2010.02037","author":"Wu Mike","year":"2020","unstructured":"Mike Wu, Milan Mosse, Chengxu Zhuang, Daniel Yamins, and Noah Goodman. 2020. Conditional negative sampling for contrastive learning of visual representations. arXiv preprint arXiv:2010.02037 (2020)."},{"key":"e_1_3_2_2_41_1","volume-title":"Unsupervised feature learning via non-parametric instance-level discrimination. arXiv preprint arXiv:1805.01978","author":"Wu Zhirong","year":"2018","unstructured":"Zhirong Wu, Yuanjun Xiong, Stella Yu, and Dahua Lin. 2018. Unsupervised feature learning via non-parametric instance-level discrimination. arXiv preprint arXiv:1805.01978 (2018)."},{"volume-title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning. In International conference on machine learning. PMLR.","author":"Xia Jun","key":"e_1_3_2_2_42_1","unstructured":"Jun Xia, Lirong Wu, Ge Wang, and Stan Z. Li. 2022. ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning. In International conference on machine learning. PMLR."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412754"},{"key":"e_1_3_2_2_44_1","volume-title":"Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems","author":"Yang Jaewon","year":"2015","unstructured":"Jaewon Yang and Jure Leskovec. 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems (2015)."},{"key":"e_1_3_2_2_45_1","unstructured":"Jure Zbontar Li Jing Ishan Misra Yann LeCun and St\u00e9phane Deny. 2021. Barlow twins: Self-supervised learning via redundancy reduction. In ICML. PMLR."},{"key":"e_1_3_2_2_46_1","first-page":"76","article-title":"From canonical correlation analysis to self-supervised graph neural networks","volume":"34","author":"Zhang Hengrui","year":"2021","unstructured":"Hengrui Zhang, Qitian Wu, Junchi Yan, David Wipf, and Philip S Yu. 2021. From canonical correlation analysis to self-supervised graph neural networks. Advances in Neural Information Processing Systems, Vol. 34 (2021), 76--89.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539425"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26336"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/473"},{"key":"e_1_3_2_2_50_1","volume-title":"Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131","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. arXiv preprint arXiv:2006.04131 (2020)."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Barcelona Spain","acronym":"KDD '24"},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:15Z","timestamp":1750291455000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":50,"alternative-id":["10.1145\/3637528.3671898","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671898","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}