{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:35:26Z","timestamp":1770748526615,"version":"3.50.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T00:00:00Z","timestamp":1709510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2212143"],"award-info":[{"award-number":["2212143"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF CAREER","award":["1845491"],"award-info":[{"award-number":["1845491"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,3,4]]},"DOI":"10.1145\/3616855.3635786","type":"proceedings-article","created":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T18:18:12Z","timestamp":1709576292000},"page":"994-1002","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Pitfalls in Link Prediction with Graph Neural Networks: Understanding the Impact of Target-link Inclusion & Better Practices"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5364-151X","authenticated-orcid":false,"given":"Jing","family":"Zhu","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2563-3712","authenticated-orcid":false,"given":"Yuhang","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8367-0733","authenticated-orcid":false,"given":"Vassilis N.","family":"Ioannidis","sequence":"additional","affiliation":[{"name":"Amazon, Santa Clara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0262-2412","authenticated-orcid":false,"given":"Shengyi","family":"Qian","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6271-9430","authenticated-orcid":false,"given":"Wei","family":"Ai","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5030-5054","authenticated-orcid":false,"given":"Xiang","family":"Song","sequence":"additional","affiliation":[{"name":"Amazon AWS, Santa Clara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3206-8179","authenticated-orcid":false,"given":"Danai","family":"Koutra","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,3,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Friends and neighbors on the web. Social networks","author":"Adamic Lada A","year":"2003","unstructured":"Lada A Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Social networks, Vol. 25, 3 (2003), 211--230."},{"key":"e_1_3_2_1_2_1","volume-title":"Translating embeddings for modeling multi-relational data. Advances in neural information processing systems","author":"Bordes Antoine","year":"2013","unstructured":"Antoine Bordes, Nicolas Usunier, Alberto Garcia-Duran, Jason Weston, and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. Advances in neural information processing systems , Vol. 26 (2013)."},{"key":"e_1_3_2_1_3_1","volume-title":"How attentive are graph attention networks? arXiv preprint arXiv:2105.14491","author":"Brody Shaked","year":"2021","unstructured":"Shaked Brody, Uri Alon, and Eran Yahav. 2021. How attentive are graph attention networks? arXiv preprint arXiv:2105.14491 (2021)."},{"key":"e_1_3_2_1_4_1","volume-title":"Thomas Kipf, and Jakub M Tomczak.","author":"Davidson Tim R","year":"2018","unstructured":"Tim R Davidson, Luca Falorsi, Nicola De Cao, Thomas Kipf, and Jakub M Tomczak. 2018. Hyperspherical variational auto-encoders. arXiv preprint arXiv:1804.00891 (2018)."},{"key":"e_1_3_2_1_5_1","volume-title":"FakeEdge: Alleviate Dataset Shift in Link Prediction. arXiv preprint arXiv:2211.15899","author":"Dong Kaiwen","year":"2022","unstructured":"Kaiwen Dong, Yijun Tian, Zhichun Guo, Yang Yang, and Nitesh V Chawla. 2022. FakeEdge: Alleviate Dataset Shift in Link Prediction. arXiv preprint arXiv:2211.15899 (2022)."},{"key":"e_1_3_2_1_6_1","volume-title":"Mikhail Galkin, Ali Parviz, Guy Wolf, Anh Tuan Luu, and Dominique Beaini.","author":"Dwivedi Vijay Prakash","year":"2022","unstructured":"Vijay Prakash Dwivedi, Ladislav Ramp\u00e1vs ek, Mikhail Galkin, Ali Parviz, Guy Wolf, Anh Tuan Luu, and Dominique Beaini. 2022. Long range graph benchmark. arXiv preprint arXiv:2206.08164 (2022)."},{"key":"e_1_3_2_1_7_1","volume-title":"On power-law relationships of the internet topology. ACM SIGCOMM computer communication review","author":"Faloutsos Michalis","year":"1999","unstructured":"Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. 1999. On power-law relationships of the internet topology. ACM SIGCOMM computer communication review , Vol. 29, 4 (1999), 251--262."},{"key":"e_1_3_2_1_8_1","volume-title":"Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds.","author":"Fey Matthias","unstructured":"Matthias Fey and Jan E. Lenssen. 2019. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_3_2_1_9_1","volume-title":"Time travel in llms: Tracing data contamination in large language models. arXiv preprint arXiv:2308.08493","author":"Golchin Shahriar","year":"2023","unstructured":"Shahriar Golchin and Mihai Surdeanu. 2023. Time travel in llms: Tracing data contamination in large language models. arXiv preprint arXiv:2308.08493 (2023)."},{"key":"e_1_3_2_1_10_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems , Vol. 30 (2017)."},{"key":"e_1_3_2_1_11_1","volume-title":"Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020b. Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems , Vol. 33 (2020), 22118--22133."},{"key":"e_1_3_2_1_12_1","volume-title":"Strategies for pre-training graph neural networks. arXiv preprint arXiv:1905.12265","author":"Hu Weihua","year":"2019","unstructured":"Weihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik, Percy Liang, Vijay Pande, and Jure Leskovec. 2019. Strategies for pre-training graph neural networks. arXiv preprint arXiv:1905.12265 (2019)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403237"},{"key":"e_1_3_2_1_14_1","volume-title":"Efficient and effective training of language and graph neural network models. arXiv preprint arXiv:2206.10781","author":"Ioannidis Vassilis N","year":"2022","unstructured":"Vassilis N Ioannidis, Xiang Song, Da Zheng, Houyu Zhang, Jun Ma, Yi Xu, Belinda Zeng, Trishul Chilimbi, and George Karypis. 2022. Efficient and effective training of language and graph neural network models. arXiv preprint arXiv:2206.10781 (2022)."},{"key":"e_1_3_2_1_15_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. 2016a. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_16_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016b. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_19_1","volume-title":"Mining of massive data sets","author":"Leskovec Jure","unstructured":"Jure Leskovec, Anand Rajaraman, and Jeffrey David Ullman. 2020. Mining of massive data sets. Cambridge university press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5684"},{"key":"e_1_3_2_1_22_1","volume-title":"A survey of link prediction in complex networks. ACM computing surveys (CSUR)","author":"Mart'inez V'ictor","year":"2016","unstructured":"V'ictor Mart'inez, Fernando Berzal, and Juan-Carlos Cubero. 2016. A survey of link prediction in complex networks. ACM computing surveys (CSUR) , Vol. 49, 4 (2016), 1--33."},{"key":"e_1_3_2_1_23_1","unstructured":"Adam Paszke Sam Gross Soumith Chintala Gregory Chanan Edward Yang Zachary DeVito Zeming Lin Alban Desmaison Luca Antiga and Adam Lerer. 2017. Automatic differentiation in pytorch. (2017)."},{"key":"e_1_3_2_1_24_1","unstructured":"Chandan K. Reddy Llu\u00eds M\u00e0rquez Fran Valero Nikhil Rao Hugo Zaragoza Sambaran Bandyopadhyay Arnab Biswas Anlu Xing and Karthik Subbian. 2022. Shopping Queries Dataset: A Large-Scale ESCI Benchmark for Improving Product Search. (2022). arxiv: 2206.06588"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"e_1_3_2_1_26_1","volume-title":"Iker Garc'ia-Ferrero, Julen Etxaniz, Oier Lopez de Lacalle, and Eneko Agirre.","author":"Sainz Oscar","year":"2023","unstructured":"Oscar Sainz, Jon Ander Campos, Iker Garc'ia-Ferrero, Julen Etxaniz, Oier Lopez de Lacalle, and Eneko Agirre. 2023. NLP Evaluation in trouble: On the Need to Measure LLM Data Contamination for each Benchmark. arXiv preprint arXiv:2310.18018 (2023)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411872"},{"key":"e_1_3_2_1_28_1","volume-title":"International Conference on Machine Learning. PMLR, 9448--9457","author":"Teru Komal","year":"2020","unstructured":"Komal Teru, Etienne Denis, and Will Hamilton. 2020. Inductive relation prediction by subgraph reasoning. In International Conference on Machine Learning. PMLR, 9448--9457."},{"key":"e_1_3_2_1_29_1","volume-title":"Composition-based multi-relational graph convolutional networks. arXiv preprint arXiv:1911.03082","author":"Vashishth Shikhar","year":"2019","unstructured":"Shikhar Vashishth, Soumya Sanyal, Vikram Nitin, and Partha Talukdar. 2019. Composition-based multi-relational graph convolutional networks. arXiv preprint arXiv:1911.03082 (2019)."},{"key":"e_1_3_2_1_30_1","volume-title":"Highly-Performant Package for Graph Neural Networks. arXiv preprint arXiv:1909.01315","author":"Wang Minjie","year":"2019","unstructured":"Minjie Wang, Da Zheng, Zihao Ye, Quan Gan, Mufei Li, Xiang Song, Jinjing Zhou, Chao Ma, Lingfan Yu, Yu Gai, Tianjun Xiao, Tong He, George Karypis, Jinyang Li, and Zheng Zhang. 2019. Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks. arXiv preprint arXiv:1909.01315 (2019)."},{"key":"e_1_3_2_1_31_1","volume-title":"Neural Common Neighbor with Completion for Link Prediction. arXiv preprint arXiv:2302.00890","author":"Wang Xiyuan","year":"2023","unstructured":"Xiyuan Wang, Haotong Yang, and Muhan Zhang. 2023. Neural Common Neighbor with Completion for Link Prediction. arXiv preprint arXiv:2302.00890 (2023)."},{"key":"e_1_3_2_1_32_1","volume-title":"International conference on machine learning. PMLR, 5453--5462","author":"Xu Keyulu","year":"2018","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 International conference on machine learning. PMLR, 5453--5462."},{"key":"e_1_3_2_1_33_1","volume-title":"International Conference on Machine Learning. PMLR, 11659--11669","author":"Yan Zuoyu","year":"2021","unstructured":"Zuoyu Yan, Tengfei Ma, Liangcai Gao, Zhi Tang, and Chao Chen. 2021. Link prediction with persistent homology: An interactive view. In International Conference on Machine Learning. PMLR, 11659--11669."},{"key":"e_1_3_2_1_34_1","volume-title":"International conference on machine learning. PMLR, 7134--7143","author":"You Jiaxuan","year":"2019","unstructured":"Jiaxuan You, Rex Ying, and Jure Leskovec. 2019. Position-aware graph neural networks. In International conference on machine learning. PMLR, 7134--7143."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jproteome.0c00316"},{"key":"e_1_3_2_1_36_1","volume-title":"Link prediction based on graph neural networks. Advances in neural information processing systems","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in neural information processing systems , Vol. 31 (2018)."},{"key":"e_1_3_2_1_37_1","volume-title":"Inductive matrix completion based on graph neural networks. arXiv preprint arXiv:1904.12058","author":"Zhang Muhan","year":"2019","unstructured":"Muhan Zhang and Yixin Chen. 2019. Inductive matrix completion based on graph neural networks. arXiv preprint arXiv:1904.12058 (2019)."},{"key":"e_1_3_2_1_38_1","first-page":"9061","article-title":"Labeling trick: A theory of using graph neural networks for multi-node representation learning","volume":"34","author":"Zhang Muhan","year":"2021","unstructured":"Muhan Zhang, Pan Li, Yinglong Xia, Kai Wang, and Long Jin. 2021. Labeling trick: A theory of using graph neural networks for multi-node representation learning. Advances in Neural Information Processing Systems , Vol. 34 (2021), 9061--9073.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/IA351965.2020.00011"},{"key":"e_1_3_2_1_40_1","volume-title":"Xu Chen, Yankai Lin, Ji-Rong Wen, and Jiawei Han. 2023 b. Don't Make Your LLM an Evaluation Benchmark Cheater. arXiv preprint arXiv:2311.01964","author":"Zhou Kun","year":"2023","unstructured":"Kun Zhou, Yutao Zhu, Zhipeng Chen, Wentong Chen, Wayne Xin Zhao, Xu Chen, Yankai Lin, Ji-Rong Wen, and Jiawei Han. 2023 b. Don't Make Your LLM an Evaluation Benchmark Cheater. arXiv preprint arXiv:2311.01964 (2023)."},{"key":"e_1_3_2_1_41_1","volume-title":"2023 a. Explore Spurious Correlations at the Concept Level in Language Models for Text Classification. arXiv preprint arXiv:2311.08648","author":"Zhou Yuhang","year":"2023","unstructured":"Yuhang Zhou, Paiheng Xu, Xiaoyu Liu, Bang An, Wei Ai, and Furong Huang. 2023 a. Explore Spurious Correlations at the Concept Level in Language Models for Text Classification. arXiv preprint arXiv:2311.08648 (2023)."},{"key":"e_1_3_2_1_42_1","volume-title":"TouchUp-G: Improving Feature Representation through Graph-Centric Finetuning. arXiv preprint arXiv:2309.13885","author":"Zhu Jing","year":"2023","unstructured":"Jing Zhu, Xiang Song, Vassilis N Ioannidis, Danai Koutra, and Christos Faloutsos. 2023. TouchUp-G: Improving Feature Representation through Graph-Centric Finetuning. arXiv preprint arXiv:2309.13885 (2023)."},{"key":"e_1_3_2_1_43_1","first-page":"29476","article-title":"Neural bellman-ford networks: A general graph neural network framework for link prediction","volume":"34","author":"Zhu Zhaocheng","year":"2021","unstructured":"Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal Xhonneux, and Jian Tang. 2021. Neural bellman-ford networks: A general graph neural network framework for link prediction. Advances in Neural Information Processing Systems , Vol. 34 (2021), 29476--29490. io","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"WSDM '24: The 17th ACM International Conference on Web Search and Data Mining","location":"Merida Mexico","acronym":"WSDM '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 17th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3616855.3635786","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3616855.3635786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:56:31Z","timestamp":1755824191000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3616855.3635786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,4]]},"references-count":43,"alternative-id":["10.1145\/3616855.3635786","10.1145\/3616855"],"URL":"https:\/\/doi.org\/10.1145\/3616855.3635786","relation":{},"subject":[],"published":{"date-parts":[[2024,3,4]]},"assertion":[{"value":"2024-03-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}