{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T15:27:02Z","timestamp":1773588422578,"version":"3.50.1"},"reference-count":81,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:00:00Z","timestamp":1772841600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CHE-2202693"],"award-info":[{"award-number":["CHE-2202693"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2026,4,30]]},"abstract":"<jats:p>Link Prediction (LP) is a fundamental task in graph representation learning, with numerous applications in diverse domains. However, the generalizability of LP models is often compromised due to the presence of noisy or spurious information in graphs and the inherent incompleteness of graph data. To address these challenges, we draw inspiration from the Information Bottleneck principle and propose a novel data augmentation method, COmplete and REduce (CORE) to learn compact and predictive augmentations for LP models. In particular, CORE aims to recover missing edges in graphs while simultaneously removing noise from the graph structures, thereby enhancing the model\u2019s robustness and performance. Extensive experiments on multiple benchmark datasets demonstrate the applicability and superiority of CORE over state-of-the-art methods, showcasing its potential as a leading approach for robust LP in graph representation learning.<\/jats:p>","DOI":"10.1145\/3789200","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T06:00:25Z","timestamp":1772690425000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["CORE: Data Augmentation for Link Prediction via Information Bottleneck"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8244-9562","authenticated-orcid":false,"given":"Kaiwen","family":"Dong","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7673-8568","authenticated-orcid":false,"given":"Zhichun","family":"Guo","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3932-5956","authenticated-orcid":false,"given":"Nitesh V.","family":"Chawla","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,7]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_3_3_2","unstructured":"Alexander A. Alemi Ian Fischer Joshua V. Dillon and Kevin Murphy. 2023. Deep Variational Information Bottleneck. Retrieved from https:\/\/openreview.net\/forum?id=HyxQzBceg"},{"key":"e_1_3_3_4_2","unstructured":"Martin Arjovsky L\u00e9on Bottou Ishaan Gulrajani and David Lopez-Paz. 2019. Invariant Risk Minimization. Retrieved from https:\/\/arxiv.org\/abs\/1907.02893v3"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_3_6_2","unstructured":"Vladimir Batagelj and Andrej Mrvar. 2006. Pajek Datasets Website. Retrieved from http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"e_1_3_3_7_2","doi-asserted-by":"crossref","unstructured":"Mikhail Belkin. 2021. Fit without fear: Remarkable mathematical phenomena of deep learning through the prism of interpolation. arXiv:2105.14368. Retrieved from https:\/\/arxiv.org\/abs\/2105.14368","DOI":"10.1017\/S0962492921000039"},{"key":"e_1_3_3_8_2","first-page":"107","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin Sergey","year":"1998","unstructured":"Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual web search engine. Computer Networks 30 (1998), 107\u2013117. Retrieved from http:\/\/www-db.stanford.edu\/\u223cbackrub\/google.html","journal-title":"Computer Networks"},{"key":"e_1_3_3_9_2","unstructured":"Benjamin Paul Chamberlain Sergey Shirobokov Emanuele Rossi Fabrizio Frasca Thomas Markovich Nils Yannick Hammerla Michael M. Bronstein and Max Hansmire. 2022. Graph Neural Networks for Link Prediction with Subgraph Sketching. Retrieved from https:\/\/openreview.net\/forum?id=m1oqEOAozQU"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.953"},{"key":"e_1_3_3_11_2","first-page":"19314","volume-title":"Advances in Neural Information Processing Systems","author":"Chen Yu","year":"2020","unstructured":"Yu Chen, Lingfei Wu, and Mohammed Zaki. 2020. Iterative deep graph learning for graph neural networks: Better and robust node embeddings. In Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin (Eds.), Vol. 33, Curran Associates, Inc., 19314\u201319326. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/e05c7ba4e087beea9410929698dc41a6-Abstract.html"},{"key":"e_1_3_3_12_2","unstructured":"Yoon-Sik Cho. 2024. Decouped Variational Graph Autoencoder for Link Prediction. Retrieved from https:\/\/openreview.net\/forum?id=qoKHBoLzwX&referrer=%5Bthe%20profile%20of%20Yoon-Sik%20Cho%5D(%2Fprofile%3Fid%3D\u223cYoon-Sik_Cho1)"},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Ekin D. Cubuk Barret Zoph Dandelion Mane Vijay Vasudevan and Quoc V. Le. 2019. AutoAugment: Learning augmentation policies from data. arXiv:1805.09501. Retrieved from https:\/\/arxiv.org\/abs\/1805.09501","DOI":"10.1109\/CVPR.2019.00020"},{"key":"e_1_3_3_14_2","unstructured":"Terrance DeVries and Graham W. Taylor. 2017. Improved regularization of convolutional neural networks with cutout. arXiv:1708.04552. Retrieved from https:\/\/arxiv.org\/abs\/1708.04552"},{"key":"e_1_3_3_15_2","unstructured":"Kaiwen Dong Yijun Tian Zhichun Guo Yang Yang and Nitesh Chawla. 2022. FakeEdge: Alleviate Dataset Shift in Link Prediction. Retrieved from https:\/\/openreview.net\/forum?id=QDN0jSXuvtX"},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erdos Paul","year":"1959","unstructured":"Paul Erdos. 1959. On random graphs. Publicationes Mathematicae 6 (1959), 290\u2013297.","journal-title":"Publicationes Mathematicae"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3672035"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.84"},{"key":"e_1_3_3_19_2","volume-title":"ICLR Workshop on Representation Learning on Graphs and Manifolds","author":"Fey Matthias","year":"2019","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_3_20_2","unstructured":"Justin Gilmer Samuel S. Schoenholz Patrick F. Riley Oriol Vinyals and George E. Dahl. 2017. Neural message passing for quantum chemistry. arXiv:1704.01212. Retrieved from https:\/\/arxiv.org\/abs\/1704.01212"},{"key":"e_1_3_3_21_2","unstructured":"William L. Hamilton Rex Ying and Jure Leskovec. 2018. Inductive representation learning on large graphs. arXiv:1706.02216. Retrieved from https:\/\/arxiv.org\/abs\/1706.02216"},{"key":"e_1_3_3_22_2","first-page":"1209","volume-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI \u201920)","author":"Hao Yu","year":"2021","unstructured":"Yu Hao, Xin Cao, Yixiang Fang, Xike Xie, and Sibo Wang. 2021. Inductive link prediction for nodes having only attribute information. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI \u201920). Yokohama, Yokohama, Japan, 1209\u20131215."},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"e_1_3_3_25_2","unstructured":"Weihua Hu Matthias Fey Marinka Zitnik Yuxiao Dong Hongyu Ren Bowen Liu Michele Catasta and Jure Leskovec. 2021. Open graph benchmark: Datasets for machine learning on graphs. arXiv:2005.00687. Retrieved from https:\/\/arxiv.org\/abs\/2005.00687"},{"key":"e_1_3_3_26_2","unstructured":"EunJeong Hwang Veronika Thost Shib Sankar Dasgupta and Tengfei Ma. 2022. An Analysis of Virtual Nodes in Graph Neural Networks for Link Prediction (Extended Abstract). Retrieved from https:\/\/openreview.net\/forum?id=dI6KBKNRp7"},{"key":"e_1_3_3_27_2","unstructured":"Eric Jang Shixiang Gu and Ben Poole. 2023. Categorical Reparameterization with Gumbel-Softmax. Retrieved from https:\/\/openreview.net\/forum?id=rkE3y85ee"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599768"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_3_30_2","unstructured":"Diederik P. Kingma and Max Welling. 2014. Auto-encoding variational Bayes. arXiv:1312.6114. Retrieved from https:\/\/arxiv.org\/abs\/1312.6114"},{"key":"e_1_3_3_31_2","unstructured":"Thomas N. Kipf and Max Welling. 2016. Variational Graph Auto-Encoders. https:\/\/arxiv.org\/abs\/1611.07308. Retrieved from https:\/\/arxiv.org\/abs\/1611.07308"},{"key":"e_1_3_3_32_2","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. Retrieved from https:\/\/arxiv.org\/abs\/1609.02907"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_3_34_2","unstructured":"David Krueger Ethan Caballero Joern-Henrik Jacobsen Amy Zhang Jonathan Binas Dinghuai Zhang Remi Le Priol and Aaron Courville. 2020. Out-of-Distribution Generalization via Risk Extrapolation (REx). Retrieved from https:\/\/arxiv.org\/abs\/2003.00688v5"},{"key":"e_1_3_3_35_2","unstructured":"Lin Li and Michael Spratling. 2023. Data Augmentation Alone Can Improve Adversarial Training. Retrieved from https:\/\/arxiv.org\/abs\/2301.09879v1"},{"key":"e_1_3_3_36_2","first-page":"4465","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Li Pan","year":"2020","unstructured":"Pan Li, Yanbang Wang, Hongwei Wang, and Jure Leskovec. 2020. Distance encoding: Design provably more powerful neural networks for graph representation learning. In Advances in Neural Information Processing Systems. H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin (Eds.), Vol. 33, Curran Associates, Inc., 4465\u20134478. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/2f73168bf3656f697507752ec592c437-Paper.pdf"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"e_1_3_3_39_2","unstructured":"Youzhi Luo Michael McThrow Wing Yee Au Tao Komikado Kanji Uchino Koji Maruhashi and Shuiwang Ji. 2023. Automated Data Augmentations for Graph Classification. arXiv:2202.13248. Retrieved from https:\/\/arxiv.org\/abs\/2202.13248"},{"key":"e_1_3_3_40_2","unstructured":"Chris J. Maddison Andriy Mnih and Yee Whye Teh. 2023. The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables. Retrieved from https:\/\/openreview.net\/forum?id=S1jE5L5gl"},{"key":"e_1_3_3_41_2","unstructured":"Siqi Miao Miaoyuan Liu and Pan Li. 2022. Interpretable and generalizable graph learning via stochastic attention mechanism. arXiv:2201.12987. Retrieved from https:\/\/arxiv.org\/abs\/2201.12987"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2021.111230"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104772"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_3_3_45_2","volume-title":"International Conference on Learning Representations","author":"Pan Liming","year":"2022","unstructured":"Liming Pan, Cheng Shi, and Ivan Dokmani\u0107. 2022. Neural link prediction with walk pooling. In International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=CCu6RcUMwK0"},{"key":"e_1_3_3_46_2","unstructured":"P\u00e1l Andr\u00e1s Papp Karolis Martinkus Lukas Faber and Roger Wattenhofer. 2021. DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. arXiv:2111.06283. Retrieved from https:\/\/arxiv.org\/abs\/2111.06283"},{"key":"e_1_3_3_47_2","volume-title":"International Conference on Learning Representations","author":"Rong Yu","year":"2020","unstructured":"Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2020. DropEdge: Towards deep graph convolutional networks on node classification. In International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=Hkx1qkrKPr"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.5555\/576628"},{"key":"e_1_3_3_49_2","unstructured":"Oleksandr Shchur Maximilian Mumme Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Pitfalls of graph neural network evaluation. arXiv:1811.05868. Retrieved from https:\/\/arxiv.org\/abs\/1811.05868"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.110882"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0197-0"},{"key":"e_1_3_3_52_2","unstructured":"Abhay Singh Qian Huang Sijia Linda Huang Omkar Bhalerao Horace He Ser-Nam Lim and Austin R. Benson. 2021. Edge proposal sets for link prediction. arXiv:2106.15810. Retrieved from https:\/\/arxiv.org\/abs\/2106.15810"},{"key":"e_1_3_3_53_2","unstructured":"Krishna Kumar Singh Hao Yu Aron Sarmasi Gautam Pradeep and Yong Jae Lee. 2018. Hide-and-seek: A data augmentation technique for weakly-supervised localization and beyond. arXiv:1811.02545. Retrieved from https:\/\/arxiv.org\/abs\/1811.02545"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633039"},{"key":"e_1_3_3_55_2","unstructured":"Qingyun Sun Jianxin Li Hao Peng Jia Wu Xingcheng Fu Cheng Ji and Philip S. Yu. 2021. Graph structure learning with variational information bottleneck. arXiv:2112.08903. Retrieved from https:\/\/arxiv.org\/abs\/2112.08903"},{"key":"e_1_3_3_56_2","unstructured":"Susheel Suresh Pan Li Cong Hao and Jennifer Neville. 2021. Adversarial graph augmentation to improve graph contrastive learning. arXiv:2106.05819. Retrieved from https:\/\/arxiv.org\/abs\/2106.05819"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gky1131"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","unstructured":"Naftali Tishby Fernando C. Pereira and William Bialek. 2000. The information bottleneck method. DOI: 10.48550\/arXiv.physics\/0004057","DOI":"10.48550\/arXiv.physics\/0004057"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133169"},{"key":"e_1_3_3_60_2","unstructured":"Jake Topping Francesco Di Giovanni Benjamin Paul Chamberlain Xiaowen Dong and Michael M. Bronstein. 2022. Understanding over-squashing and bottlenecks on graphs via curvature. arXiv:2111.14522. Retrieved from https:\/\/arxiv.org\/abs\/2111.14522"},{"key":"e_1_3_3_61_2","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in Neural Information Processing Systems. Vol. 30, Curran Associates, Inc. Retrieved from https:\/\/papers.nips.cc\/paper\/2017\/hash\/3f5ee243547dee91fbd053c1c4a845aa-Abstract.html"},{"key":"e_1_3_3_62_2","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph attention networks. arXiv:1710.10903. Retrieved from https:\/\/arxiv.org\/abs\/1710.10903"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature750"},{"key":"e_1_3_3_64_2","unstructured":"Xiyuan Wang Haotong Yang and Muhan Zhang. 2023. Neural common neighbor with completion for link prediction. arXiv:2302.00890. Retrieved from https:\/\/arxiv.org\/abs\/2302.00890"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403063"},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_3_67_2","unstructured":"Qitian Wu Hengrui Zhang Junchi Yan and David Wipf. 2022. Handling Distribution Shifts on Graphs: An Invariance Perspective. Retrieved from https:\/\/openreview.net\/forum?id=FQOC5u-1egI"},{"key":"e_1_3_3_68_2","unstructured":"Tailin Wu Hongyu Ren Pan Li and Jure Leskovec. 2020. Graph information bottleneck. arXiv:2010.12811. Retrieved from https:\/\/arxiv.org\/abs\/2010.12811"},{"key":"e_1_3_3_69_2","unstructured":"Qizhe Xie Zihang Dai Eduard Hovy Minh-Thang Luong and Quoc V. Le. 2020. Unsupervised data augmentation for consistency training. arXiv:1904.12848. Retrieved from https:\/\/arxiv.org\/abs\/1904.12848"},{"key":"e_1_3_3_70_2","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. 2018. How powerful are graph neural networks? arXiv:1810.00826. Retrieved from https:\/\/arxiv.org\/abs\/1810.00826"},{"key":"e_1_3_3_71_2","unstructured":"Yuning You Tianlong Chen Yongduo Sui Ting Chen Zhangyang Wang and Yang Shen. 2021. Graph contrastive learning with augmentations. arXiv:2010.13902. Retrieved from https:\/\/arxiv.org\/abs\/2010.13902"},{"key":"e_1_3_3_72_2","unstructured":"Junchi Yu Tingyang Xu Yu Rong Yatao Bian Junzhou Huang and Ran He. 2020. Graph information bottleneck for subgraph recognition. arXiv:2010.05563. Retrieved from https:\/\/arxiv.org\/abs\/2010.05563"},{"key":"e_1_3_3_73_2","volume-title":"Advances in Neural Information Processing Systems","volume":"31","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. In Advances in Neural Information Processing Systems. S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett (Eds.), Vol. 31. Curran Associates, Inc. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2018\/file\/53f0d7c537d99b3824f0f99d62ea2428-Paper.pdf"},{"key":"e_1_3_3_74_2","first-page":"9061","volume-title":"Advances in Neural Information Processing Systems","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. In Advances in Neural Information Processing Systems. M. Ranzato, A. Beygelzimer, Y. Dauphin, P. S. Liang, and J. Wortman Vaughan (Eds.), Vol. 34. Curran Associates, Inc., 9061\u20139073. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/4be49c79f233b4f4070794825c323733-Paper.pdf"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512179"},{"key":"e_1_3_3_76_2","unstructured":"Xiang Zhang Junbo Zhao and Yann LeCun. 2016. Character-level convolutional networks for text classification. arXiv:1509.01626. Retrieved from https:\/\/arxiv.org\/abs\/1509.01626"},{"key":"e_1_3_3_77_2","unstructured":"Tong Zhao Wei Jin Yozen Liu Yingheng Wang Gang Liu Stephan G\u00fcnnemann Neil Shah and Meng Jiang. 2023. Graph data augmentation for graph machine learning: A survey. arXiv:2202.08871. Retrieved from https:\/\/arxiv.org\/abs\/2202.08871"},{"key":"e_1_3_3_78_2","first-page":"26911","volume-title":"Proceedings of the 39th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 162)","author":"Zhao, Gang Liu Tong","year":"2022","unstructured":"Tong Zhao, Gang Liu, Daheng Wang, Wenhao Yu, and Meng Jiang. 2022. Learning from counterfactual links for link prediction. In Proceedings of the 39th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 162). Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (Eds.), PMLR, 26911\u201326926. Retrieved from https:\/\/proceedings.mlr.press\/v162\/zhao22e.html"},{"key":"e_1_3_3_79_2","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3526000"},{"key":"e_1_3_3_80_2","unstructured":"Zhun Zhong Liang Zheng Guoliang Kang Shaozi Li and Yi Yang. 2017. Random erasing data augmentation. arXiv:1708.04896. Retrieved from https:\/\/arxiv.org\/abs\/1708.04896"},{"key":"e_1_3_3_81_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"e_1_3_3_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3789200","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3789200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T13:41:06Z","timestamp":1773582066000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3789200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,7]]},"references-count":81,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4,30]]}},"alternative-id":["10.1145\/3789200"],"URL":"https:\/\/doi.org\/10.1145\/3789200","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,7]]},"assertion":[{"value":"2024-08-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}