{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T07:20:37Z","timestamp":1774509637993,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":99,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US Department of Transportation (USDOT) Tier-1 University Transportation Center (UTC) Transportation Cybersecurity Center for Advanced Research and Education (CYBER-CARE)","award":["69A3552348332"],"award-info":[{"award-number":["69A3552348332"]}]},{"name":"Rice University Ken Kennedy Institute"},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS 1817046"],"award-info":[{"award-number":["IIS 1817046"]}],"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":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709314","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:44:43Z","timestamp":1743792283000},"page":"1044-1055","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Attribute-Enhanced Similarity Ranking for Sparse Link Prediction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6877-1608","authenticated-orcid":false,"given":"Joao","family":"Mattos","sequence":"first","affiliation":[{"name":"Rice University, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1480-4494","authenticated-orcid":false,"given":"Zexi","family":"Huang","sequence":"additional","affiliation":[{"name":"UC Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8092-5024","authenticated-orcid":false,"given":"Mert","family":"Kosan","sequence":"additional","affiliation":[{"name":"UC Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1997-7140","authenticated-orcid":false,"given":"Ambuj","family":"Singh","sequence":"additional","affiliation":[{"name":"UC Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1792-0076","authenticated-orcid":false,"given":"Arlei","family":"Silva","sequence":"additional","affiliation":[{"name":"Rice University, Houston, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_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_2_2_1","doi-asserted-by":"crossref","unstructured":"Ashwin Bahulkar Boleslaw K Szymanski N Orkun Baycik and Thomas C Sharkey. 2018. Community detection with edge augmentation in criminal networks. In ASONAM.","DOI":"10.1109\/ASONAM.2018.8508326"},{"key":"e_1_3_2_2_3_1","volume-title":"Network Science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2016. Network Science. Cambridge University Press."},{"key":"e_1_3_2_2_4_1","volume-title":"Evolution of the social network of scientific collaborations. Physica A: Statistical mechanics and its applications","author":"Barab\u00e1si Albert-Laszlo","year":"2002","unstructured":"Albert-Laszlo Barab\u00e1si, Hawoong Jeong, Zoltan N\u00e9da, Erzsebet Ravasz, Andras Schubert, and Tamas Vicsek. 2002. Evolution of the social network of scientific collaborations. Physica A: Statistical mechanics and its applications, Vol. 311, 3--4 (2002), 590--614."},{"key":"e_1_3_2_2_5_1","unstructured":"Antoine Bordes Nicolas Usunier Alberto Garc\u00eda-Dur\u00e1n Jason Weston and Oksana Yakhnenko. 2013. Translating Embeddings for Modeling Multi-relational Data. In NeurIPS."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Sebastian Bruch. 2021. An alternative cross entropy loss for learning-to-rank. In WebConf.","DOI":"10.1145\/3442381.3449794"},{"key":"e_1_3_2_2_7_1","volume-title":"International conference on machine learning. PMLR, 872--881","author":"Byrd Jonathon","year":"2019","unstructured":"Jonathon Byrd and Zachary Lipton. 2019. What is the effect of importance weighting in deep learning?. In International conference on machine learning. PMLR, 872--881."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3080635"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Fatih Cakir Kun He Xide Xia Brian Kulis and Stan Sclaroff. 2019. Deep metric learning to rank. In CVPR.","DOI":"10.1109\/CVPR.2019.00196"},{"key":"e_1_3_2_2_10_1","unstructured":"Benjamin Paul Chamberlain Sergey Shirobokov Emanuele Rossi Fabrizio Frasca Thomas Markovich Nils Hammerla Michael M Bronstein and Max Hansmire. 2023. Graph Neural Networks for Link Prediction with Subgraph Sketching. In ICLR."},{"key":"e_1_3_2_2_11_1","unstructured":"Ines Chami Zhitao Ying Christopher R\u00e9 and Jure Leskovec. 2019. Hyperbolic graph convolutional neural networks. In NeurIPS."},{"key":"e_1_3_2_2_12_1","volume-title":"Advances in Neural Information Processing Systems","volume":"22","author":"Chen Wei","year":"2009","unstructured":"Wei Chen, Tie-Yan Liu, Yanyan Lan, Zhi-Ming Ma, and Hang Li. 2009. Ranking measures and loss functions in learning to rank. Advances in Neural Information Processing Systems, Vol. 22 (2009)."},{"key":"e_1_3_2_2_13_1","unstructured":"Xu Chen Xiuyuan Cheng and St\u00e9phane Mallat. 2014. Unsupervised deep haar scattering on graphs. In NeurIPS."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Yuzhou Chen Yulia R Gel and H Vincent Poor. 2022. BScNets: Block Simplicial Complex Neural Networks. In AAAI.","DOI":"10.1609\/aaai.v36i6.20583"},{"key":"e_1_3_2_2_15_1","unstructured":"Yu Chen Lingfei Wu and Mohammed Zaki. 2020. Iterative deep graph learning for graph neural networks: Better and robust node embeddings. In NeurIPS."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"e_1_3_2_2_17_1","unstructured":"Arlei Lopes da Silva Furkan Kocayusufoglu Saber Jafarpour Francesco Bullo Ananthram Swami and Ambuj Singh. 2020. Combining Physics and Machine Learning for Network Flow Estimation. In ICLR."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Jesse Davis and Mark Goadrich. 2006. The relationship between Precision-Recall and ROC curves. In ICML.","DOI":"10.1145\/1143844.1143874"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0903215107"},{"key":"e_1_3_2_2_20_1","volume-title":"Maria Sofia Bucarelli, and Fabrizio Silvestri","author":"Di Francesco Andrea Giuseppe","year":"2024","unstructured":"Andrea Giuseppe Di Francesco, Francesco Caso, Maria Sofia Bucarelli, and Fabrizio Silvestri. 2024. Link Prediction under Heterophily: A Physics-Inspired Graph Neural Network Approach. arXiv preprint arXiv:2402.14802 (2024)."},{"key":"e_1_3_2_2_21_1","volume-title":"Community detection in graphs. Physics reports","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato. 2010. Community detection in graphs. Physics reports, Vol. 486, 3--5 (2010), 75--174."},{"key":"e_1_3_2_2_22_1","unstructured":"Luca Franceschi Mathias Niepert Massimiliano Pontil and Xiao He. 2019. Learning discrete structures for graph neural networks. In ICML."},{"key":"e_1_3_2_2_23_1","volume-title":"JMLR","volume":"4","author":"Freund Yoav","year":"2003","unstructured":"Yoav Freund, Raj Iyer, Robert E Schapire, and Yoram Singer. 2003. An efficient boosting algorithm for combining preferences. JMLR, Vol. 4, Nov (2003), 933--969."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In SIGKDD.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_25_1","volume-title":"Graphite: Iterative generative modeling of graphs. In ICML.","author":"Grover Aditya","year":"2019","unstructured":"Aditya Grover, Aaron Zweig, and Stefano Ermon. 2019. Graphite: Iterative generative modeling of graphs. In ICML."},{"key":"e_1_3_2_2_26_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_2_27_1","unstructured":"Weihua Hu Matthias Fey Marinka Zitnik Yuxiao Dong Hongyu Ren Bowen Liu Michele Catasta and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. In NeurIPS."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Zexi Huang Mert Kosan Sourav Medya Sayan Ranu and Ambuj Singh. 2023a. Global counterfactual explainer for graph neural networks. In WSDM.","DOI":"10.1145\/3539597.3570376"},{"key":"e_1_3_2_2_29_1","volume-title":"Link prediction without graph neural networks. arXiv preprint arXiv:2305.13656","author":"Huang Zexi","year":"2023","unstructured":"Zexi Huang, Mert Kosan, Arlei Silva, and Ambuj Singh. 2023b. Link prediction without graph neural networks. arXiv preprint arXiv:2305.13656 (2023)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Zexi Huang Arlei Silva and Ambuj Singh. 2021. A Broader Picture of Random-walk Based Graph Embedding. In SIGKDD.","DOI":"10.1145\/3447548.3467300"},{"key":"e_1_3_2_2_31_1","volume-title":"POLE: Polarized Embedding for Signed Networks. In WSDM.","author":"Huang Zexi","year":"2022","unstructured":"Zexi Huang, Arlei Silva, and Ambuj Singh. 2022. POLE: Polarized Embedding for Signed Networks. In WSDM."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Boris Ivanovic and Marco Pavone. 2019. The trajectron: Probabilistic multi-agent trajectory modeling with dynamic spatiotemporal graphs. In ICCV.","DOI":"10.1109\/ICCV.2019.00246"},{"key":"e_1_3_2_2_33_1","unstructured":"Mohsen Jamali and Martin Ester. 2009. Trustwalker: a random walk model for combining trust-based and item-based recommendation. In SIGKDD."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2002. Simrank: a measure of structural-context similarity. In SIGKDD.","DOI":"10.1145\/775107.775126"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_2_38_1","volume-title":"Adam: A method for stochastic optimization. In ICLR.","author":"Kingma Diederik P","year":"2015","unstructured":"Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In ICLR."},{"key":"e_1_3_2_2_39_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. 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_2_40_1","unstructured":"Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_2_41_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052643"},{"key":"e_1_3_2_2_43_1","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Li Juanhui","year":"2024","unstructured":"Juanhui Li, Harry Shomer, Haitao Mao, Shenglai Zeng, Yao Ma, Neil Shah, Jiliang Tang, and Dawei Yin. 2024. Evaluating graph neural networks for link prediction: Current pitfalls and new benchmarking. Advances in Neural Information Processing Systems, Vol. 36 (2024)."},{"key":"e_1_3_2_2_44_1","unstructured":"Yujia Li Oriol Vinyals Chris Dyer Razvan Pascanu and Peter Battaglia. 2018. Learning deep generative models of graphs. In ICML."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Zheyi Liu Darong Lai Chuanyou Li and Meng Wang. 2020. Feature Fusion Based Subgraph Classification for Link Prediction. In CIKM.","DOI":"10.1145\/3340531.3411966"},{"key":"e_1_3_2_2_47_1","volume-title":"Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications","author":"L\u00fc Linyuan","year":"2011","unstructured":"Linyuan L\u00fc and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications, Vol. 390, 6 (2011), 1150--1170."},{"key":"e_1_3_2_2_48_1","volume-title":"Revisiting link prediction: A data perspective. arXiv preprint arXiv:2310.00793","author":"Mao Haitao","year":"2023","unstructured":"Haitao Mao, Juanhui Li, Harry Shomer, Bingheng Li, Wenqi Fan, Yao Ma, Tong Zhao, Neil Shah, and Jiliang Tang. 2023. Revisiting link prediction: A data perspective. arXiv preprint arXiv:2310.00793 (2023)."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.93.012306"},{"key":"e_1_3_2_2_50_1","volume-title":"A survey of link prediction in complex networks. ACM computing surveys (CSUR)","author":"Mart\u00ednez V\u00edctor","year":"2016","unstructured":"V\u00edctor Mart\u00ednez, 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_2_51_1","unstructured":"Brian McFee and Gert Lanckriet. 2010. Metric learning to rank. In ICML."},{"key":"e_1_3_2_2_52_1","unstructured":"Federico Monti Michael Bronstein and Xavier Bresson. 2017. Geometric matrix completion with recurrent multi-graph neural networks. In NeurIPS."},{"key":"e_1_3_2_2_53_1","volume-title":"Gaurav Rattan, and Martin Grohe.","author":"Morris Christopher","year":"2019","unstructured":"Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe. 2019. Weisfeiler and leman go neural: Higher-order graph neural networks. In AAAI."},{"key":"e_1_3_2_2_54_1","volume-title":"Networks","author":"Newman Mark","unstructured":"Mark Newman. 2018. Networks. Oxford university press."},{"key":"e_1_3_2_2_55_1","volume-title":"Clustering and preferential attachment in growing networks. Physical review E","author":"Newman Mark EJ","year":"2001","unstructured":"Mark EJ Newman. 2001. Clustering and preferential attachment in growing networks. Physical review E, Vol. 64, 2 (2001), 025102."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_2_57_1","unstructured":"Mingdong Ou Peng Cui Jian Pei Ziwei Zhang and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding. In SIGKDD."},{"key":"e_1_3_2_2_58_1","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab."},{"key":"e_1_3_2_2_59_1","unstructured":"Liming Pan Cheng Shi and Ivan Dokmani\u0107. 2022. Neural Link Prediction with Walk Pooling. In ICLR."},{"key":"e_1_3_2_2_60_1","volume-title":"Pytorch: An imperative style, high-performance deep learning library. In NeurIPS.","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, et al. 2019. Pytorch: An imperative style, high-performance deep learning library. In NeurIPS."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1002\/prot.20865"},{"key":"e_1_3_2_2_63_1","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018a. Network embedding as matrix factorization: Unifying deepwalk line pte and node2vec. In WSDM."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220077"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Jerome Revaud Jon Almaz\u00e1n Rafael S Rezende and Cesar Roberto de Souza. 2019. Learning with average precision: Training image retrieval with a listwise loss. In ICCV.","DOI":"10.1109\/ICCV.2019.00521"},{"key":"e_1_3_2_2_66_1","unstructured":"Sunil Kumar Sahu Fenia Christopoulou Makoto Miwa and Sophia Ananiadou. 2019. Inter-sentence Relation Extraction with Document-level Graph Convolutional Neural Network. In ACL."},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0118432"},{"key":"e_1_3_2_2_68_1","volume-title":"Josh Merel, Martin Riedmiller, Raia Hadsell, and Peter Battaglia.","author":"Sanchez-Gonzalez Alvaro","year":"2018","unstructured":"Alvaro Sanchez-Gonzalez, Nicolas Heess, Jost Tobias Springenberg, Josh Merel, Martin Riedmiller, Raia Hadsell, and Peter Battaglia. 2018. Graph networks as learnable physics engines for inference and control. In ICML."},{"key":"e_1_3_2_2_69_1","volume-title":"Introduction to information retrieval","author":"Sch\u00fctze Hinrich","unstructured":"Hinrich Sch\u00fctze, Christopher D Manning, and Prabhakar Raghavan. 2008. Introduction to information retrieval. Vol. 39. Cambridge University Press Cambridge."},{"key":"e_1_3_2_2_70_1","volume-title":"Omkar Bhalerao, Horace He, Ser-Nam Lim, and Austin R Benson.","author":"Singh Abhay","year":"2021","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 preprint arXiv:2106.15810 (2021)."},{"key":"e_1_3_2_2_71_1","unstructured":"Kihyuk Sohn. 2016. Improved deep metric learning with multi-class n-pair loss objective. In NeurIPS."},{"key":"e_1_3_2_2_72_1","unstructured":"Haitian Sun Bhuwan Dhingra Manzil Zaheer Kathryn Mazaitis Ruslan Salakhutdinov and William Cohen. 2018b. Open Domain Question Answering Using Early Fusion of Knowledge Bases and Text. In EMNLP."},{"key":"e_1_3_2_2_73_1","unstructured":"Zhiqing Sun Zhi-Hong Deng Jian-Yun Nie and Jian Tang. 2018a. RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space. In ICLR."},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008b. Arnetminer: extraction and mining of academic social networks. In SIGKDD.","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2002909"},{"key":"e_1_3_2_2_76_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330989"},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"crossref","unstructured":"Xinshao Wang Yang Hua Elyor Kodirov Guosheng Hu Romain Garnier and Neil M Robertson. 2019b. Ranked list loss for deep metric learning. In ICCV.","DOI":"10.1109\/CVPR.2019.00535"},{"key":"e_1_3_2_2_79_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_2_80_1","volume-title":"End to end learning and optimization on graphs. NeurIPS","author":"Wilder Bryan","year":"2019","unstructured":"Bryan Wilder, Eric Ewing, Bistra Dilkina, and Milind Tambe. 2019. End to end learning and optimization on graphs. NeurIPS (2019)."},{"key":"e_1_3_2_2_81_1","unstructured":"Felix Wu Amauri Souza Tianyi Zhang Christopher Fifty Tao Yu and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In ICML."},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"crossref","unstructured":"Fen Xia Tie-Yan Liu Jue Wang Wensheng Zhang and Hang Li. 2008. Listwise approach to learning to rank: theory and algorithm. In ICML.","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_2_83_1","unstructured":"Zuoyu Yan Tengfei Ma Liangcai Gao Zhi Tang and Chao Chen. 2021. Link prediction with persistent homology: An interactive view. In ICML."},{"key":"e_1_3_2_2_84_1","volume-title":"Xiaodong He, Jianfeng Gao, and Li Deng.","author":"Yang Bishan","year":"2015","unstructured":"Bishan Yang, Scott Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. 2015. Embedding Entities and Relations for Learning and Inference in Knowledge Bases. In ICLR."},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"crossref","unstructured":"Yonghui Yang Le Wu Richang Hong Kun Zhang and Meng Wang. 2021. Enhanced graph learning for collaborative filtering via mutual information maximization. In SIGIR.","DOI":"10.1145\/3404835.3462928"},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"crossref","unstructured":"Liang Yao Chengsheng Mao and Yuan Luo. 2019. Graph convolutional networks for text classification. In AAAI.","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"e_1_3_2_2_87_1","unstructured":"Zhitao Ying Jiaxuan You Christopher Morris Xiang Ren Will Hamilton and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. In NeurIPS."},{"key":"e_1_3_2_2_88_1","volume-title":"Graphrnn: Generating realistic graphs with deep auto-regressive models. In ICML.","author":"You Jiaxuan","year":"2018","unstructured":"Jiaxuan You, Rex Ying, Xiang Ren, William Hamilton, and Jure Leskovec. 2018. Graphrnn: Generating realistic graphs with deep auto-regressive models. In ICML."},{"key":"e_1_3_2_2_89_1","unstructured":"Seongjun Yun Seoyoon Kim Junhyun Lee Jaewoo Kang and Hyunwoo J Kim. 2021. Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction. In NeurIPS."},{"key":"e_1_3_2_2_90_1","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. In NeurIPS."},{"key":"e_1_3_2_2_91_1","doi-asserted-by":"crossref","unstructured":"Muhan Zhang Zhicheng Cui Marion Neumann and Yixin Chen. 2018a. An end-to-end deep learning architecture for graph classification. In AAAI.","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"e_1_3_2_2_92_1","doi-asserted-by":"crossref","unstructured":"Yiding Zhang Xiao Wang Chuan Shi Nian Liu and Guojie Song. 2021. Lorentzian graph convolutional networks. In WebConf.","DOI":"10.1145\/3442381.3449872"},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"crossref","unstructured":"Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018b. Arbitrary-order proximity preserved network embedding. In SIGKDD.","DOI":"10.1145\/3219819.3219969"},{"key":"e_1_3_2_2_94_1","volume-title":"Graph data augmentation for graph machine learning: A survey. arXiv preprint arXiv:2202.08871","author":"Zhao Tong","year":"2022","unstructured":"Tong Zhao, Gang Liu, Stephan G\u00fcnnemann, and Meng Jiang. 2022. Graph data augmentation for graph machine learning: A survey. arXiv preprint arXiv:2202.08871 (2022)."},{"key":"e_1_3_2_2_95_1","doi-asserted-by":"crossref","unstructured":"Tong Zhao Yozen Liu Leonardo Neves Oliver Woodford Meng Jiang and Neil Shah. 2021. Data augmentation for graph neural networks. In AAAI.","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"e_1_3_2_2_96_1","unstructured":"Cheng Zheng Bo Zong Wei Cheng Dongjin Song Jingchao Ni Wenchao Yu Haifeng Chen and Wei Wang. 2020. Robust graph representation learning via neural sparsification. In ICML."},{"key":"e_1_3_2_2_97_1","volume-title":"Link prediction on heterophilic graphs via disentangled representation learning. arXiv preprint arXiv:2208.01820","author":"Zhou Shijie","year":"2022","unstructured":"Shijie Zhou, Zhimeng Guo, Charu Aggarwal, Xiang Zhang, and Suhang Wang. 2022. Link prediction on heterophilic graphs via disentangled representation learning. arXiv preprint arXiv:2208.01820 (2022)."},{"key":"e_1_3_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"e_1_3_2_2_99_1","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. In NeurIPS."}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:44:59Z","timestamp":1755359099000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":99,"alternative-id":["10.1145\/3690624.3709314","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709314","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}