{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:40:19Z","timestamp":1777614019490,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":80,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"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":["IIS-2321504, IIS-2334193, IIS-2340346, IIS-2217239, CNS-2426514, CNS-2203261, and CMMI-2146076"],"award-info":[{"award-number":["IIS-2321504, IIS-2334193, IIS-2340346, IIS-2217239, CNS-2426514, CNS-2203261, and CMMI-2146076"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,10]]},"DOI":"10.1145\/3701551.3703550","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T12:30:16Z","timestamp":1740573016000},"page":"697-706","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Training MLPs on Graphs without Supervision"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7670-6777","authenticated-orcid":false,"given":"Zehong","family":"Wang","sequence":"first","affiliation":[{"name":"University of Notre Dame, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5918-6182","authenticated-orcid":false,"given":"Zheyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8349-7926","authenticated-orcid":false,"given":"Chuxu","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, Connecticut, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6038-2173","authenticated-orcid":false,"given":"Yanfang","family":"Ye","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, Indiana, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Alexander A. Alemi Ian Fischer Joshua V. Dillon and Kevin Murphy. 2017. Deep Variational Information Bottleneck. In ICLR."},{"key":"e_1_3_2_1_2_1","unstructured":"Philip Bachman R Devon Hjelm and William Buchwalter. 2020. Learning representations by maximizing mutual information across views. In NeurIPS."},{"key":"e_1_3_2_1_3_1","unstructured":"Joshua Batson and Loic Royer. 2019. Noise2self: Blind denoising by self-supervision. In ICML."},{"key":"e_1_3_2_1_4_1","unstructured":"Mohamed Ishmael Belghazi Aristide Baratin Sai Rajeshwar Sherjil Ozair Yoshua Bengio Aaron Courville and Devon Hjelm. 2018. Mutual information neural estimation. In ICML."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Deli Chen Yankai Lin Wei Li Peng Li Jie Zhou and Xu Sun. 2020b. Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In AAAI.","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"e_1_3_2_1_6_1","unstructured":"Lei Chen Zhengdao Chen and Joan Bruna. 2021. On Graph Neural Networks versus Graph-Augmented MLPs. In ICLR."},{"key":"e_1_3_2_1_7_1","unstructured":"Ming Chen Zhewei Wei Zengfeng Huang Bolin Ding and Yaliang Li. 2020c. Simple and deep graph convolutional networks. In ICML."},{"key":"e_1_3_2_1_8_1","unstructured":"Ting Chen Simon Kornblith Mohammad Norouzi and Geoffrey Hinton. 2020a. A simple framework for contrastive learning of visual representations. In ICML."},{"key":"e_1_3_2_1_9_1","unstructured":"Mucong Ding Kezhi Kong Jingling Li Chen Zhu John Dickerson Furong Huang and Tom Goldstein. 2021. VQ-GNN: A universal framework to scale up graph neural networks using vector quantization. In NeurIPS."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Wei Dong Junsheng Wu Yi Luo Zongyuan Ge and Peng Wang. 2022. Node representation learning in graph via node-to-neighbourhood mutual information maximization. In CVPR.","DOI":"10.1109\/CVPR52688.2022.01612"},{"key":"e_1_3_2_1_11_1","unstructured":"Jonathan Frankle and Michael Carbin. 2019. The Lottery Ticket Hypothesis: Finding Sparse Trainable Neural Networks. In ICLR."},{"key":"e_1_3_2_1_12_1","unstructured":"Johannes Gasteiger Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Combining Neural Networks with Personalized PageRank for Classification on Graphs. In ICLR."},{"key":"e_1_3_2_1_13_1","unstructured":"Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural message passing for quantum chemistry. In ICML."},{"key":"e_1_3_2_1_14_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. In NeurIPS."},{"key":"e_1_3_2_1_15_1","unstructured":"Zhichun Guo William Shiao Shichang Zhang Yozen Liu Nitesh V Chawla Neil Shah and Tong Zhao. 2023. Linkless link prediction via relational distillation. In ICML."},{"key":"e_1_3_2_1_16_1","unstructured":"Suyog Gupta Ankur Agrawal Kailash Gopalakrishnan and Pritish Narayanan. 2015. Deep learning with limited numerical precision. In ICML."},{"key":"e_1_3_2_1_17_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_1_18_1","unstructured":"Song Han Jeff Pool John Tran and William Dally. 2015. Learning both weights and connections for efficient neural network. In NeurIPS."},{"key":"e_1_3_2_1_19_1","unstructured":"Xiaotian Han Tong Zhao Yozen Liu Xia Hu and Neil Shah. 2023. MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization. In ICLR."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Bowen Hao Jing Zhang Hongzhi Yin Cuiping Li and Hong Chen. 2021. Pre-training graph neural networks for cold-start users and items representation. In WSDM.","DOI":"10.1145\/3437963.3441738"},{"key":"e_1_3_2_1_21_1","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In ICML."},{"key":"e_1_3_2_1_22_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_1_23_1","volume-title":"Distilling the knowledge in a neural network. arXiv","author":"Hinton Geoffrey","year":"2015","unstructured":"Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. 2015. Distilling the knowledge in a neural network. arXiv (2015)."},{"key":"e_1_3_2_1_24_1","volume-title":"Hongzhi Chen, and Ming-Chang Yang.","author":"Hou Yifan","year":"2019","unstructured":"Yifan Hou, Jian Zhang, James Cheng, Kaili Ma, Richard TB Ma, Hongzhi Chen, and Ming-Chang Yang. 2019. Measuring and Improving the Use of Graph Information in Graph Neural Networks. In ICLR."},{"key":"e_1_3_2_1_25_1","volume-title":"Graphmae: Self-supervised masked graph autoencoders. In KDD.","author":"Hou Zhenyu","year":"2022","unstructured":"Zhenyu Hou, Xiao Liu, Yukuo Cen, Yuxiao Dong, Hongxia Yang, Chunjie Wang, and Jie Tang. 2022. Graphmae: Self-supervised masked graph autoencoders. In KDD."},{"key":"e_1_3_2_1_26_1","volume-title":"Graph-mlp: Node classification without message passing in graph. arXiv","author":"Hu Yang","year":"2021","unstructured":"Yang Hu, Haoxuan You, Zhecan Wang, Zhicheng Wang, Erjin Zhou, and Yue Gao. 2021. Graph-mlp: Node classification without message passing in graph. arXiv (2021)."},{"key":"e_1_3_2_1_27_1","unstructured":"Weiran Huang Mingyang Yi Xuyang Zhao and Zihao Jiang. 2023. Towards the Generalization of Contrastive Self-Supervised Learning. In ICLR."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Benoit Jacob Skirmantas Kligys Bo Chen Menglong Zhu Matthew Tang Andrew Howard Hartwig Adam and Dmitry Kalenichenko. 2018. Quantization and training of neural networks for efficient integer-arithmetic-only inference. In CVPR.","DOI":"10.1109\/CVPR.2018.00286"},{"key":"e_1_3_2_1_29_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_1_30_1","volume-title":"Sung Ju Hwang, and Jinwoo Shin","author":"Lee Hankook","year":"2020","unstructured":"Hankook Lee, Sung Ju Hwang, and Jinwoo Shin. 2020. Self-supervised label augmentation via input transformations. In ICML."},{"key":"e_1_3_2_1_31_1","unstructured":"Xiang Li Renyu Zhu Yao Cheng Caihua Shan Siqiang Luo Dongsheng Li and Weining Qian. 2022. Finding global homophily in graph neural networks when meeting heterophily. In ICML."},{"key":"e_1_3_2_1_32_1","unstructured":"Tsung-Yi Lin Priya Goyal Ross Girshick Kaiming He and Piotr Doll\u00e1r. 2017. Focal loss for dense object detection. In ICCV."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Siwei Liu Iadh Ounis and Craig Macdonald. 2022. An MLP-based algorithm for efficient contrastive graph recommendations. In SIGIR.","DOI":"10.1145\/3477495.3531874"},{"key":"e_1_3_2_1_34_1","unstructured":"Zheyuan Liu Xiaoxin He Yijun Tian and Nitesh V Chawla. 2024. Can we soft prompt LLMs for graph learning tasks?. In WWW."},{"key":"e_1_3_2_1_35_1","unstructured":"Zheyuan Liu Chunhui Zhang Yijun Tian Erchi Zhang Chao Huang Yanfang Ye and Chuxu Zhang. 2023. Fair graph representation learning via diverse mixture-of-experts. In WWW."},{"key":"e_1_3_2_1_36_1","unstructured":"Sitao Luan Chenqing Hua Qincheng Lu Jiaqi Zhu Mingde Zhao Shuyuan Zhang Xiao-Wen Chang and Doina Precup. 2022. Revisiting heterophily for graph neural networks. In NeurIPS."},{"key":"e_1_3_2_1_37_1","volume-title":"Latent variable analysis","author":"Muth\u00e9n Bengt","year":"2004","unstructured":"Bengt Muth\u00e9n. 2004. Latent variable analysis. The Sage handbook of quantitative methodology for the social sciences (2004)."},{"key":"e_1_3_2_1_38_1","volume-title":"graph2vec: Learning distributed representations of graphs. arXiv","author":"Narayanan Annamalai","year":"2017","unstructured":"Annamalai Narayanan, Mahinthan Chandramohan, Rajasekar Venkatesan, Lihui Chen, Yang Liu, and Shantanu Jaiswal. 2017. graph2vec: Learning distributed representations of graphs. arXiv (2017)."},{"key":"e_1_3_2_1_39_1","volume-title":"Kurt Mehlhorn, and Karsten M Borgwardt.","author":"Shervashidze Nino","year":"2011","unstructured":"Nino Shervashidze, Pascal Schweitzer, Erik Jan Van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011. Weisfeiler-lehman graph kernels. JMLR (2011)."},{"key":"e_1_3_2_1_40_1","volume-title":"Normalized cuts and image segmentation. TPAMI","author":"Shi Jianbo","year":"2000","unstructured":"Jianbo Shi and Jitendra Malik. 2000. Normalized cuts and image segmentation. TPAMI (2000)."},{"key":"e_1_3_2_1_41_1","volume-title":"Opening the black box of deep neural networks via information. arXiv","author":"Shwartz-Ziv Ravid","year":"2017","unstructured":"Ravid Shwartz-Ziv and Naftali Tishby. 2017. Opening the black box of deep neural networks via information. arXiv (2017)."},{"key":"e_1_3_2_1_42_1","volume-title":"A simple min-cut algorithm. J. ACM","author":"Stoer Mechthild","year":"1997","unstructured":"Mechthild Stoer and Frank Wagner. 1997. A simple min-cut algorithm. J. ACM (1997)."},{"key":"e_1_3_2_1_43_1","unstructured":"Fan-Yun Sun Jordan Hoffman Vikas Verma and Jian Tang. 2020. InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization. In ICLR."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Siqi Sun Yu Cheng Zhe Gan and Jingjing Liu. 2019. Patient knowledge distillation for bert model compression. In EMNLP.","DOI":"10.18653\/v1\/D19-1441"},{"key":"e_1_3_2_1_45_1","unstructured":"Xiangguo Sun Hong Cheng Jia Li Bo Liu and Jihong Guan. 2023. All in One: Multi-Task Prompting for Graph Neural Networks. In KDD."},{"key":"e_1_3_2_1_46_1","volume-title":"Mehdi Azabou, Eva L Dyer, Remi Munos, Petar Veli\u010dkovi\u0107, and Michal Valko.","author":"Thakoor Shantanu","year":"2022","unstructured":"Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Mehdi Azabou, Eva L Dyer, Remi Munos, Petar Veli\u010dkovi\u0107, and Michal Valko. 2022. Large-Scale Representation Learning on Graphs via Bootstrapping. In ICLR."},{"key":"e_1_3_2_1_47_1","unstructured":"Yonglong Tian Dilip Krishnan and Phillip Isola. 2020a. Contrastive Representation Distillation. In ICLR."},{"key":"e_1_3_2_1_48_1","volume-title":"What makes for good views for contrastive learning? NeurIPS","author":"Tian Yonglong","year":"2020","unstructured":"Yonglong Tian, Chen Sun, Ben Poole, Dilip Krishnan, Cordelia Schmid, and Phillip Isola. 2020b. What makes for good views for contrastive learning? NeurIPS (2020)."},{"key":"e_1_3_2_1_49_1","unstructured":"Yijun Tian Chuxu Zhang Zhichun Guo Xiangliang Zhang and Nitesh Chawla. 2023. Learning MLPs on graphs: A unified view of effectiveness robustness and efficiency. In ICLR."},{"key":"e_1_3_2_1_50_1","volume-title":"The information bottleneck method. arXiv","author":"Tishby Naftali","year":"2000","unstructured":"Naftali Tishby, Fernando C Pereira, and William Bialek. 2000. The information bottleneck method. arXiv (2000)."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Naftali Tishby and Noga Zaslavsky. 2015. Deep learning and the information bottleneck principle. In ITW.","DOI":"10.1109\/ITW.2015.7133169"},{"key":"e_1_3_2_1_52_1","unstructured":"Aaron Van Den Oord Oriol Vinyals et al. 2017. Neural discrete representation learning. In NeurIPS."},{"key":"e_1_3_2_1_53_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_1_54_1","unstructured":"Petar Veli\u010dkovi\u0107 William Fedus William L. Hamilton Pietro Li\u00f2 Yoshua Bengio and R Devon Hjelm. 2019. Deep Graph Infomax. In ICLR."},{"key":"e_1_3_2_1_55_1","volume-title":"Apan: Asynchronous propagation attention network for real-time temporal graph embedding. In SIGMOD.","author":"Wang Xuhong","year":"2021","unstructured":"Xuhong Wang, Ding Lyu, Mengjian Li, Yang Xia, Qi Yang, Xinwen Wang, Xinguang Wang, Ping Cui, Yupu Yang, Bowen Sun, et al. 2021. Apan: Asynchronous propagation attention network for real-time temporal graph embedding. In SIGMOD."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Yiwei Wang Bryan Hooi Yozen Liu and Neil Shah. 2023a. Graph Explicit Neural Networks: Explicitly Encoding Graphs for Efficient and Accurate Inference. In WSDM.","DOI":"10.1145\/3539597.3570388"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Zehong Wang Qi Li Donghua Yu Xiaolong Han Xiao-Zhi Gao and Shigen Shen. 2023b. Heterogeneous graph contrastive multi-view learning. In SDM.","DOI":"10.1137\/1.9781611977653.ch16"},{"key":"e_1_3_2_1_58_1","volume-title":"Select Your Own Counterparts: Self-Supervised Graph Contrastive Learning With Positive Sampling. TNNLS","author":"Wang Zehong","year":"2024","unstructured":"Zehong Wang, Donghua Yu, Shigen Shen, Shichao Zhang, Huawen Liu, Shuang Yao, and Maozu Guo. 2024a. Select Your Own Counterparts: Self-Supervised Graph Contrastive Learning With Positive Sampling. TNNLS (2024)."},{"key":"e_1_3_2_1_59_1","volume-title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary. In NeurIPS.","author":"Wang Zehong","year":"2024","unstructured":"Zehong Wang, Zheyuan Zhang, Nitesh V Chawla, Chuxu Zhang, and Yanfang Ye. 2024b. GFT: Graph Foundation Model with Transferable Tree Vocabulary. In NeurIPS."},{"key":"e_1_3_2_1_60_1","volume-title":"Subgraph Pooling: Tackling Negative Transfer on Graphs. In IJCAI.","author":"Wang Zehong","year":"2024","unstructured":"Zehong Wang, Zheyuan Zhang, Chuxu Zhang, and Yanfang Ye. 2024c. Subgraph Pooling: Tackling Negative Transfer on Graphs. In IJCAI."},{"key":"e_1_3_2_1_61_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_1_62_1","unstructured":"Teng Xiao Huaisheng Zhu Zhengyu Chen and Suhang Wang. 2024a. Simple and asymmetric graph contrastive learning without augmentations. In NeurIPS."},{"key":"e_1_3_2_1_63_1","unstructured":"Teng Xiao Huaisheng Zhu Zhiwei Zhang Zhimeng Guo Charu C Aggarwal Suhang Wang and Vasant G Honavar. 2024b. Efficient Contrastive Learning for Fast and Accurate Inference on Graphs. In ICML."},{"key":"e_1_3_2_1_64_1","unstructured":"Yaochen Xie Zhao Xu and Shuiwang Ji. 2022. Self-supervised representation learning via latent graph prediction. In ICML."},{"key":"e_1_3_2_1_65_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In ICLR."},{"key":"e_1_3_2_1_66_1","volume-title":"Tinygnn: Learning efficient graph neural networks. In KDD.","author":"Yan Bencheng","year":"2020","unstructured":"Bencheng Yan, Chaokun Wang, Gaoyang Guo, and Yunkai Lou. 2020. Tinygnn: Learning efficient graph neural networks. In KDD."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Pinar Yanardag and SVN Vishwanathan. 2015. Deep graph kernels. In KDD.","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Cheng Yang Jiawei Liu and Chuan Shi. 2021. Extract the knowledge of graph neural networks and go beyond it: An effective knowledge distillation framework. In WWW.","DOI":"10.1145\/3442381.3450068"},{"key":"e_1_3_2_1_69_1","unstructured":"Chenxiao Yang Qitian Wu Jiahua Wang and Junchi Yan. 2023. Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPs. In ICLR."},{"key":"e_1_3_2_1_70_1","unstructured":"Ling Yang Ye Tian Minkai Xu Zhongyi Liu Shenda Hong Wei Qu Wentao Zhang Bin CUI Muhan Zhang and Jure Leskovec. 2024. VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs. In ICLR."},{"key":"e_1_3_2_1_71_1","unstructured":"Yuning You Tianlong Chen Yang Shen and Zhangyang Wang. 2021. Graph contrastive learning automated. In ICML."},{"key":"e_1_3_2_1_72_1","unstructured":"Yuning You Tianlong Chen Yongduo Sui Ting Chen Zhangyang Wang and Yang Shen. 2020. Graph contrastive learning with augmentations. In NeurIPS."},{"key":"e_1_3_2_1_73_1","unstructured":"Shichang Zhang Yozen Liu Yizhou Sun and Neil Shah. 2022. Graph-less Neural Networks: Teaching Old MLPs New Tricks Via Distillation. In ICLR."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Zheyuan Zhang Zehong Wang Shifu Hou Evan Hall Landon Bachman Jasmine White Vincent Galassi Nitesh V Chawla Chuxu Zhang and Yanfang Ye. 2024. Diet-ODIN: A Novel Framework for Opioid Misuse Detection with Interpretable Dietary Patterns. In KDD.","DOI":"10.1145\/3637528.3671587"},{"key":"e_1_3_2_1_75_1","volume-title":"Varun Sameer Taneja","author":"Zhang Zheyuan","unstructured":"Zheyuan Zhang, Zehong Wang, Tianyi Ma, Varun Sameer Taneja, Sofia Nelson, Nhi Ha Lan Le, Keerthiram Murugesan, Mingxuan Ju, Nitesh V Chawla, Chuxu Zhang, and Yanfang Ye. 2025. MOPI-HFRS: A Multi-objective Personalized Health-aware Food Recommendation System with LLM-enhanced Interpretation. In KDD."},{"key":"e_1_3_2_1_76_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_1_77_1","volume-title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods. In ICLR.","author":"Zheng Wenqing","year":"2022","unstructured":"Wenqing Zheng, Edward W Huang, Nikhil Rao, Sumeet Katariya, Zhangyang Wang, and Karthik Subbian. 2022. Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods. In ICLR."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"crossref","unstructured":"Hongkuan Zhou Ajitesh Srivastava Hanqing Zeng Rajgopal Kannan and Viktor Prasanna. 2021. Accelerating large scale real-time GNN inference using channel pruning. In VLDB.","DOI":"10.14778\/3461535.3461547"},{"key":"e_1_3_2_1_79_1","volume-title":"Deep graph contrastive representation learning. arXiv","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 (2020)."},{"key":"e_1_3_2_1_80_1","unstructured":"Yanqiao Zhu Yichen Xu Feng Yu Qiang Liu Shu Wu and Liang Wang. 2021. Graph contrastive learning with adaptive augmentation. In WWW."}],"event":{"name":"WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining","location":"Hannover Germany","acronym":"WSDM '25","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 Eighteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703550","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701551.3703550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T09:10:05Z","timestamp":1755767405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":80,"alternative-id":["10.1145\/3701551.3703550","10.1145\/3701551"],"URL":"https:\/\/doi.org\/10.1145\/3701551.3703550","relation":{},"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"2025-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}