{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:58:27Z","timestamp":1773511107022,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T00:00:00Z","timestamp":1698278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Fund for Distinguished Young Scholarship of China","award":["62025602"],"award-info":[{"award-number":["62025602"]}]},{"name":"Tencent Foundation and XPLORER PRIZE"},{"name":"National Natural Science Foundation of China","award":["U22B2036,11931915,U1936210,U1936208"],"award-info":[{"award-number":["U22B2036,11931915,U1936210,U1936208"]}]},{"name":"Fok Ying-Tong Education Foundation China","award":["171105"],"award-info":[{"award-number":["171105"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,26]]},"DOI":"10.1145\/3581783.3612196","type":"proceedings-article","created":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T07:26:54Z","timestamp":1698391614000},"page":"481-489","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Propagation is All You Need: A New Framework for Representation Learning and Classifier Training on Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1229-7987","authenticated-orcid":false,"given":"Jiaming","family":"Zhuo","sequence":"first","affiliation":[{"name":"Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7656-9776","authenticated-orcid":false,"given":"Can","family":"Cui","sequence":"additional","affiliation":[{"name":"Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8399-9101","authenticated-orcid":false,"given":"Kun","family":"Fu","sequence":"additional","affiliation":[{"name":"Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8125-5472","authenticated-orcid":false,"given":"Bingxin","family":"Niu","sequence":"additional","affiliation":[{"name":"Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1915-4179","authenticated-orcid":false,"given":"Dongxiao","family":"He","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4592-8083","authenticated-orcid":false,"given":"Yuanfang","family":"Guo","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5007-6327","authenticated-orcid":false,"given":"Zhen","family":"Wang","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, Xi'an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3856-7646","authenticated-orcid":false,"given":"Chuan","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7141-708X","authenticated-orcid":false,"given":"Xiaochun","family":"Cao","sequence":"additional","affiliation":[{"name":"Sun Yat-Sen University, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6291-4359","authenticated-orcid":false,"given":"Liang","family":"Yang","sequence":"additional","affiliation":[{"name":"Hebei University of Technology, Tianjin, China"}]}],"member":"320","published-online":{"date-parts":[[2023,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Deyu Bo Xiao Wang Chuan Shi and Huawei Shen. 2021. Beyond Low-frequency Information in Graph Convolutional Networks. (2021) 3950--3957.","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"e_1_3_2_1_2_1","volume-title":"A Note on Over-Smoothing for Graph Neural Networks. CoRR","author":"Cai Chen","year":"2020","unstructured":"Chen Cai and Yusu Wang. 2020. A Note on Over-Smoothing for Graph Neural Networks. CoRR, Vol. abs\/2006.13318 (2020). [arXiv]2006.13318"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503161.3548120"},{"key":"e_1_3_2_1_4_1","volume-title":"ICML","volume":"119","author":"Chen Ming","year":"2020","unstructured":"Ming Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding, and Yaliang Li. 2020. Simple and Deep Graph Convolutional Networks. In ICML, Vol. 119. PMLR, 1725--1735."},{"key":"e_1_3_2_1_5_1","unstructured":"Eli Chien Jianhao Peng Pan Li and Olgica Milenkovic. 2021. Adaptive Universal Generalized PageRank Graph Neural Network. In ICLR."},{"key":"e_1_3_2_1_6_1","volume-title":"Dahl","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. 2017. Neural Message Passing for Quantum Chemistry. In ICML, Doina Precup and Yee Whye Teh (Eds.), Vol. 70. PMLR, 1263--1272."},{"key":"e_1_3_2_1_7_1","volume-title":"Learning the k in k-means","author":"Hamerly Greg","unstructured":"Greg Hamerly and Charles Elkan. 2003. Learning the k in k-means. In NIPS, Sebastian Thrun, Lawrence K. Saul, and Bernhard Sch\u00f6lkopf (Eds.). MIT Press, 281--288."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_1_9_1","unstructured":"Yixuan He Quan Gan David Wipf Gesine D. Reinert Junchi Yan and Mihai Cucuringu. 2022. GNNRank: Learning Global Rankings from Pairwise Comparisons via Directed Graph Neural Networks. In ICML. 8581--8612."},{"key":"e_1_3_2_1_10_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. OpenReview.net."},{"key":"e_1_3_2_1_11_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Predict then Propagate: Graph Neural Networks meet Personalized PageRank. In ICLR. OpenReview.net."},{"key":"e_1_3_2_1_12_1","volume-title":"Vaishnavi Gupta, Omkar Bhalerao, and Ser-Nam Lim.","author":"Lim Derek","year":"2021","unstructured":"Derek Lim, Felix Hohne, Xiuyu Li, Sijia Linda Huang, Vaishnavi Gupta, Omkar Bhalerao, and Ser-Nam Lim. 2021. Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods. In NeurIPS, Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, and Jennifer Wortman Vaughan (Eds.). 20887--20902."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3087514"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3190939"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Yao Ma Xiaorui Liu Tong Zhao Yozen Liu Jiliang Tang and Neil Shah. 2021. A Unified View on Graph Neural Networks as Graph Signal Denoising. 1202--1211 pages. https:\/\/doi.org\/10.1145\/3459637.3482225","DOI":"10.1145\/3459637.3482225"},{"key":"e_1_3_2_1_16_1","volume-title":"Yu Lei, and Bo Yang.","author":"Pei Hongbin","year":"2020","unstructured":"Hongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei, and Bo Yang. 2020. Geom-GCN: Geometric Graph Convolutional Networks. In ICLR. OpenReview.net."},{"key":"e_1_3_2_1_17_1","volume-title":"Khanh Hoa Dam, and Svetha Venkatesh","author":"Pham Trang","year":"2017","unstructured":"Trang Pham, Truyen Tran, Khanh Hoa Dam, and Svetha Venkatesh. 2017. Graph Classification via Deep Learning with Virtual Nodes. CoRR, Vol. abs\/1708.04357 (2017). showeprint[arXiv]1708.04357"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3090354.3090427"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"e_1_3_2_1_20_1","article-title":"Visualizing data using t-SNE","volume":"9","author":"der Maaten Laurens Van","year":"2008","unstructured":"Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of machine learning research, Vol. 9, 11 (2008).","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_1_21_1","volume-title":"Message passing all the way up. CoRR","author":"Velickovic Petar","year":"2022","unstructured":"Petar Velickovic. 2022. Message passing all the way up. CoRR, Vol. abs\/2202.11097 (2022). [arXiv]2202.11097"},{"key":"e_1_3_2_1_22_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR. OpenReview.net."},{"key":"e_1_3_2_1_23_1","volume-title":"A tutorial on spectral clustering. Statistics and computing","author":"Luxburg Ulrike Von","year":"2007","unstructured":"Ulrike Von Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing, Vol. 17, 4 (2007), 395--416."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Shiping Wang Zhihao Wu Yuhong Chen and Yong Chen. 2023. Beyond Graph Convolutional Network: An Interpretable Regularizer-Centered Optimization Framework. (2023) 4693--4701.","DOI":"10.1609\/aaai.v37i4.25593"},{"key":"e_1_3_2_1_25_1","volume-title":"Weinberger","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri H. Souza Jr., Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Q. Weinberger. 2019. Simplifying Graph Convolutional Networks. In ICML, Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.), Vol. 97. PMLR, 6861--6871."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00165"},{"key":"e_1_3_2_1_27_1","volume-title":"Jennifer G. Dy and Andreas Krause (Eds.)","volume":"80","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 ICML, Jennifer G. Dy and Andreas Krause (Eds.), Vol. 80. PMLR, 5449--5458."},{"key":"e_1_3_2_1_28_1","volume-title":"Why Do Attributes Propagate in Graph Convolutional Neural Networks?","author":"Yang Liang","unstructured":"Liang Yang, Chuan Wang, Junhua Gu, Xiaochun Cao, and Bingxin Niu. 2021. Why Do Attributes Propagate in Graph Convolutional Neural Networks?. In AAAI. AAAI Press, 4590--4598."},{"key":"e_1_3_2_1_29_1","volume-title":"International conference on machine learning. PMLR, 40--48","author":"Yang Zhilin","year":"2016","unstructured":"Zhilin Yang, William Cohen, and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In International conference on machine learning. PMLR, 40--48."},{"key":"e_1_3_2_1_30_1","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link Prediction Based on Graph Neural Networks. In NeurIPS Samy Bengio Hanna M. Wallach Hugo Larochelle Kristen Grauman Nicol\u00f2 Cesa-Bianchi and Roman Garnett (Eds.). 5171--5181."},{"key":"e_1_3_2_1_31_1","volume-title":"An End-to-End Deep Learning Architecture for Graph Classification","author":"Zhang Muhan","unstructured":"Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen. 2018. An End-to-End Deep Learning Architecture for Graph Classification. In AAAI, Sheila A. McIlraith and Kilian Q. Weinberger (Eds.). AAAI Press, 4438--4445."},{"key":"e_1_3_2_1_32_1","unstructured":"Jiong Zhu Yujun Yan Lingxiao Zhao Mark Heimann Leman Akoglu and Danai Koutra. 2020. Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs. In NeurIPS Hugo Larochelle Marc'Aurelio Ranzato Raia Hadsell Maria-Florina Balcan and Hsuan-Tien Lin (Eds.)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449953"}],"event":{"name":"MM '23: The 31st ACM International Conference on Multimedia","location":"Ottawa ON Canada","acronym":"MM '23","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the 31st ACM International Conference on Multimedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581783.3612196","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3581783.3612196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:57Z","timestamp":1755820857000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581783.3612196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,26]]},"references-count":33,"alternative-id":["10.1145\/3581783.3612196","10.1145\/3581783"],"URL":"https:\/\/doi.org\/10.1145\/3581783.3612196","relation":{},"subject":[],"published":{"date-parts":[[2023,10,26]]},"assertion":[{"value":"2023-10-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}