{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:41Z","timestamp":1750309541563,"version":"3.41.0"},"reference-count":64,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:00Z","timestamp":1740182400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,4,30]]},"abstract":"<jats:p>Graph-based semi-supervised learning (GSSL) has achieved significant success across various applications by leveraging the graph structure and labeled samples for classification tasks. In the field of GSSL, Label Propagation (LP) and Graph Neural Networks (GNNs) are two complementary methods, in which LP iteratively propagates and updates node labels through connected nodes, whereas GNNs aggregate node features by incorporating information from their neighbors. Recently, the complementary nature of LP and GNNs has been utilized to improve performance through the combination of two approaches. However, the utilization of higher-order graph structures within these combined approaches, such as triangles, is still under-explored. Therefore, to advance understanding in this ongoing research, we first model GSSL as a two-step feature-label process. Then, we introduce Nonlinear Correct and Smooth (NLCS) in the post-processing step, a combined method that incorporates nonlinearity and higher-order structures into the residual propagation to handle intricate node relationships effectively. We propose a new synthetic graph generator to deepen the analysis and broaden the experimentation, providing insights into the mechanisms that enable NLCS to handle intricate node relationships effectively. Our systematic evaluations across six synthetic graphs show that NLCS outperforms base predictions by an average of 12.44% and the existing state-of-the-art post-processing method by 8.04%. Furthermore, on six commonly used real-world datasets, NLCS demonstrates a 10.9% improvement over six base prediction models and a 1.6% over the state-of-the-art post-processing method. Our comparisons and analyses reveal that NLCS substantially enhances the prediction accuracy of nodes within complex graph structures by effectively utilizing higher-order structures of graphs.<\/jats:p>","DOI":"10.1145\/3712604","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T15:59:02Z","timestamp":1737475142000},"page":"1-32","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonlinear Correct and Smooth for Graph-Based Semi-Supervised Learning"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0007-6756-8732","authenticated-orcid":false,"given":"Yuanhang","family":"Shao","sequence":"first","affiliation":[{"name":"Department of Computer Science, Florida State University, Tallahassee, Florida, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-9320-3872","authenticated-orcid":false,"given":"Xiuwen","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Florida State University, Tallahassee, Florida, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2","DOI":"10.1016\/j.aci.2014.10.001"},{"doi-asserted-by":"publisher","unstructured":"Peter W. Battaglia Jessica B. Hamrick Victor Bapst Alvaro Sanchez-Gonzalez Vinicius Zambaldi Mateusz Malinowski Andrea Tacchetti David Raposo Adam Santoro Ryan Faulkner et al. 2018. Relational inductive biases deep learning and graph networks. arXiv:1806.01261. Retrieved from 10.48550\/arXiv.1806.01261","key":"e_1_3_2_3_2","DOI":"10.48550\/arXiv.1806.01261"},{"issue":"3","key":"e_1_3_2_4_2","first-page":"179","article-title":"Statistical analysis of non-lattice data","volume":"24","author":"Besag Julian","year":"1975","unstructured":"Julian Besag. 1975. Statistical analysis of non-lattice data. Journal of the Royal Statistical Society Series D: The Statistician 24, 3 (1975), 179\u2013195.","journal-title":"Journal of the Royal Statistical Society Series D: The Statistician"},{"doi-asserted-by":"publisher","unstructured":"Shaked Brody Uri Alon and Eran Yahav. 2021. How attentive are graph attention networks? arXiv:2105.14491. Retrieved from 10.48550\/arXiv.2105.14491","key":"e_1_3_2_5_2","DOI":"10.48550\/arXiv.2105.14491"},{"doi-asserted-by":"publisher","key":"e_1_3_2_6_2","DOI":"10.1111\/j.1467-839X.2007.00241.x"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","first-page":"109187","DOI":"10.1016\/j.knosys.2022.109187","article-title":"GraphRR: A multiplex graph based reciprocal friend recommender system with applications on online gaming service","volume":"251","author":"Chang Yaomin","year":"2022","unstructured":"Yaomin Chang, Lin Shu, Erxin Du, Chuan Chen, Ziyang Zhang, Zibin Zheng, Yuzhao Huang, and Xingxing Xing. 2022. GraphRR: A multiplex graph based reciprocal friend recommender system with applications on online gaming service. Knowledge-Based Systems 251 (2022), 109187.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_2_8_2","series-title":"Proceedings of Machine Learning Research","first-page":"35.1","volume-title":"Proceedings of the 25th Annual Conference on Learning Theory","volume":"23","author":"Chaudhuri Kamalika","year":"2012","unstructured":"Kamalika Chaudhuri, Fan Chung, and Alexander Tsiatas. 2012. Spectral clustering of graphs with general degrees in the extended planted partition model. In Proceedings of the 25th Annual Conference on Learning Theory. Shie Mannor, Nathan Srebro, and Robert C. Williamson (Eds.), Proceedings of Machine Learning Research, Vol. 23, PMLR, 35.1\u201335.23. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.mlr.press\/v23\/chaudhuri12.html"},{"key":"e_1_3_2_9_2","series-title":"Proceedings of Machine Learning Research","first-page":"1725","volume-title":"Proceedings of the 37th International Conference on Machine Learning","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 Proceedings of the 37th International Conference on Machine Learning. Hal Daum\u00e9 III and Aarti Singh (Eds.), Proceedings of Machine Learning Research, Vol. 119, PMLR, 1725\u20131735. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.mlr.press\/v119\/chen20v.html"},{"doi-asserted-by":"publisher","key":"e_1_3_2_10_2","DOI":"10.1109\/TPAMI.2022.3174515"},{"key":"e_1_3_2_11_2","first-page":"408","volume-title":"Neurocomputing","author":"Chong Yanwen","year":"2020","unstructured":"Yanwen Chong, Yun Ding, Qing Yan, and Shaoming Pan. 2020. Graph-based semi-supervised learning: A review. Neurocomputing 408 (2020), 216\u2013230."},{"doi-asserted-by":"publisher","key":"e_1_3_2_12_2","DOI":"10.1145\/2567574.2567585"},{"doi-asserted-by":"publisher","key":"e_1_3_2_13_2","DOI":"10.1609\/aaai.v36i6.20605"},{"doi-asserted-by":"publisher","unstructured":"Leo Egghe and Ronald Rousseau. 2024. The small-world phenomenon: A model explanations characterizations and examples. arXiv:2402.10233. Retrieved from 10.48550\/arXiv.2402.10233","key":"e_1_3_2_14_2","DOI":"10.48550\/arXiv.2402.10233"},{"issue":"1","key":"e_1_3_2_15_2","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos Paul","year":"1960","unstructured":"Paul Erdos and Alfr\u00e9d R\u00e9nyi. 1960. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5, 1 (1960), 17\u201360.","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"doi-asserted-by":"publisher","key":"e_1_3_2_16_2","DOI":"10.1145\/3366423.3379997"},{"key":"e_1_3_2_17_2","first-page":"22092","article-title":"Graph random neural networks for semi-supervised learning on graphs","volume":"33","author":"Feng Wenzheng","year":"2020","unstructured":"Wenzheng Feng, Jie Zhang, Yuxiao Dong, Yu Han, Huanbo Luan, Qian Xu, Qiang Yang, Evgeny Kharlamov, and Jie Tang. 2020. Graph random neural networks for semi-supervised learning on graphs. In Advances in Neural Information Processing Systems, Vol. 33, 22092\u201322103.","journal-title":"Advances in Neural Information Processing Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_18_2","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_19_2","first-page":"659","article-title":"Community detection in networks: A user guide","author":"Fortunato Santo","year":"2016","unstructured":"Santo Fortunato and Darko Hric. 2016. Community detection in networks: A user guide. Physics Reports 659 (2016), 1\u201344.","journal-title":"Physics Reports"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"109850","DOI":"10.1016\/j.asoc.2022.109850","article-title":"CLP-GCN: Confidence and label propagation applied to graph convolutional networks","volume":"132","author":"Ghayekhloo Mohadeseh","year":"2023","unstructured":"Mohadeseh Ghayekhloo and Ahmad Nickabadi. 2023. CLP-GCN: Confidence and label propagation applied to graph convolutional networks. Applied Soft Computing 132 (2023), 109850.","journal-title":"Applied Soft Computing"},{"key":"e_1_3_2_21_2","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems. I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30, Curran Associates, Inc. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/5dd9db5e033da9c6fb5ba83c7a7ebea9-Paper.pdf"},{"doi-asserted-by":"publisher","unstructured":"William L. Hamilton Rex Ying and Jure Leskovec. 2018. Representation learning on graphs: Methods and applications. arXiv:1709.05584. Retrieved from 10.48550\/arXiv.1709.05584","key":"e_1_3_2_22_2","DOI":"10.48550\/arXiv.1709.05584"},{"key":"e_1_3_2_23_2","series-title":"Proceedings of Machine Learning Research","first-page":"12411","volume-title":"Proceedings of the 40th International Conference on Machine Learning","volume":"202","author":"Han Haoyu","year":"2023","unstructured":"Haoyu Han, Xiaorui Liu, Haitao Mao, Mohamadali Torkamani, Feng Shi, Victor Lee, and Jiliang Tang. 2023. Alternately optimized graph neural networks. In Proceedings of the 40th International Conference on Machine Learning. Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett (Eds.), Proceedings of Machine Learning Research, Vol. 202, PMLR, 12411\u201312429. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.mlr.press\/v202\/han23c.html"},{"key":"e_1_3_2_24_2","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"33","author":"Hu Weihua","year":"2020","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 Advances in Neural Information Processing Systems, Vol. 33, 22118\u201322133.","journal-title":"Advances in Neural Information Processing Systems"},{"doi-asserted-by":"publisher","unstructured":"Qian Huang Horace He Abhay Singh Ser-Nam Lim and Austin R. Benson. 2020. Combining label propagation and simple models out-performs graph neural networks. arXiv:2010.13993. Retrieved from 10.48550\/arXiv.2010.13993","key":"e_1_3_2_25_2","DOI":"10.48550\/arXiv.2010.13993"},{"doi-asserted-by":"publisher","unstructured":"Wenbing Huang Yu Rong Tingyang Xu Fuchun Sun and Junzhou Huang. 2022. Tackling over-smoothing for general graph convolutional networks. arXiv:2008.09864. Retrieved from 10.48550\/arXiv.2008.09864","key":"e_1_3_2_26_2","DOI":"10.48550\/arXiv.2008.09864"},{"doi-asserted-by":"publisher","key":"e_1_3_2_27_2","DOI":"10.1145\/3394486.3403101"},{"doi-asserted-by":"publisher","key":"e_1_3_2_28_2","DOI":"10.1137\/21M1395351"},{"doi-asserted-by":"publisher","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. Retrieved from 10.48550\/arXiv.1609.02907","key":"e_1_3_2_29_2","DOI":"10.48550\/arXiv.1609.02907"},{"doi-asserted-by":"publisher","key":"e_1_3_2_30_2","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_31_2","first-page":"9267","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision (ICCV\u00a0\u201919)","author":"Li Guohao","year":"2019","unstructured":"Guohao Li, Matthias Muller, Ali Thabet, and Bernard Ghanem. 2019. DeepGCNs: Can GCNs go as deep as CNNs?. In Proceedings of the IEEE\/CVF International Conference on Computer Vision (ICCV\u00a0\u201919), 9267\u20139276."},{"doi-asserted-by":"publisher","key":"e_1_3_2_32_2","DOI":"10.1109\/TNNLS.2024.3370918"},{"doi-asserted-by":"publisher","key":"e_1_3_2_33_2","DOI":"10.1016\/j.neunet.2020.04.028"},{"issue":"4","key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"4367","DOI":"10.1109\/TNNLS.2024.3371592","article-title":"Guest editorial: Deep neural networks for graphs: Theory, models, algorithms, and applications","volume":"35","author":"Li Ming","year":"2024","unstructured":"Ming Li, Alessio Micheli, Yu Guang Wang, Shirui Pan, Pietro Li\u00f3, Giorgio Stefano Gnecco, and Marcello Sanguineti. 2024. Guest editorial: Deep neural networks for graphs: Theory, models, algorithms, and applications. IEEE Transactions on Neural Networks and Learning Systems 35, 4 (2024), 4367\u20134372.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_35_2","DOI":"10.1609\/aaai.v32i1.11604"},{"doi-asserted-by":"publisher","key":"e_1_3_2_36_2","DOI":"10.1007\/s10618-022-00879-4"},{"doi-asserted-by":"publisher","unstructured":"Yao Ma Xiaorui Liu Neil Shah and Jiliang Tang. 2023. Is homophily a necessity for graph neural networks? arXiv:2106.06134. Retrieved from 10.48550\/arXiv.2106.06134","key":"e_1_3_2_37_2","DOI":"10.48550\/arXiv.2106.06134"},{"key":"e_1_3_2_38_2","volume-title":"Machine Learning: A Probabilistic Perspective","author":"Murphy Kevin P.","year":"2012","unstructured":"Kevin P. Murphy. 2012. Machine Learning: A Probabilistic Perspective. MIT Press."},{"doi-asserted-by":"publisher","key":"e_1_3_2_39_2","DOI":"10.1137\/S003614450342480"},{"doi-asserted-by":"publisher","unstructured":"Kenta Oono and Taiji Suzuki. 2021. Graph neural networks exponentially lose expressive power for node classification. arXiv:1905.10947. Retrieved from 10.48550\/arXiv.1905.10947","key":"e_1_3_2_40_2","DOI":"10.48550\/arXiv.1905.10947"},{"doi-asserted-by":"publisher","key":"e_1_3_2_41_2","DOI":"10.1016\/j.visinf.2023.07.003"},{"key":"e_1_3_2_42_2","series-title":"Proceedings of Machine Learning Research","first-page":"17945","volume-title":"Proceedings of the 39th International Conference on Machine Learning","volume":"162","author":"Prokopchik Konstantin","year":"2022","unstructured":"Konstantin Prokopchik, Austin R. Benson, and Francesco Tudisco. 2022. Nonlinear feature diffusion on hypergraphs. In Proceedings of the 39th International Conference on Machine Learning. Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (Eds.), Proceedings of Machine Learning Research, Vol. 162, PMLR, 17945\u201317958. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.mlr.press\/v162\/prokopchik22a.html"},{"key":"e_1_3_2_43_2","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"29","author":"Rossi Ryan","year":"2015","unstructured":"Ryan Rossi and Nesreen Ahmed. 2015. The network data repository with interactive graph analytics and visualization. Proceedings of the AAAI Conference on Artificial Intelligence 29, 1 (Mar. 2015). DOI: 10.1609\/aaai.v29i1.9277"},{"key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"106817","DOI":"10.1016\/j.knosys.2021.106817","article-title":"HeteroGraphRec: A heterogeneous graph-based neural networks for social recommendations","volume":"217","author":"Salamat Amirreza","year":"2021","unstructured":"Amirreza Salamat, Xiao Luo, and Ali Jafari. 2021. HeteroGraphRec: A heterogeneous graph-based neural networks for social recommendations. Knowledge-Based Systems 217 (2021), 106817.","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"e_1_3_2_45_2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","article-title":"The graph neural network model","volume":"20","author":"Scarselli Franco","year":"2008","unstructured":"Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2008. The graph neural network model. IEEE Transactions on Neural Networks 20, 1 (2008), 61\u201380.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"3","key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","article-title":"Collective classification in network data","volume":"29","author":"Sen Prithviraj","year":"2008","unstructured":"Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI Magazine 29, 3 (2008), 93\u201393.","journal-title":"AI Magazine"},{"doi-asserted-by":"publisher","key":"e_1_3_2_47_2","DOI":"10.1109\/IJCNN60899.2024.10650407"},{"doi-asserted-by":"publisher","key":"e_1_3_2_48_2","DOI":"10.1007\/978-3-319-56212-4"},{"key":"e_1_3_2_49_2","first-page":"11 992","volume-title":"Proceedings of the VLDB Endowment","volume":"4","author":"Sun Yizhou","year":"2011","unstructured":"Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, and Tianyi Wu. 2011. Pathsim: Meta path-based top-k similarity search in heterogeneous information networks. Proceedings of the VLDB Endowment 4, 11 (2011), 992\u20131003."},{"key":"e_1_3_2_50_2","volume-title":"Advances in Neural Information Processing Systems","author":"Szummer Martin","year":"2001","unstructured":"Martin Szummer and Tommi Jaakkola. 2001. Partially labeled classification with Markov random walks. In Advances in Neural Information Processing Systems. T. Dietterich, S. Becker, and Z. Ghahramani (Eds.), Vol. 14. MIT Press. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.neurips.cc\/paper_files\/paper\/2001\/file\/a82d922b133be19c1171534e6594f754-Paper.pdf"},{"doi-asserted-by":"publisher","unstructured":"Kiran K. Thekumparampil Chong Wang Sewoong Oh and Li-Jia Li. 2018. Attention-based graph neural network for semi-supervised learning. arXiv:1803.03735. Retrieved from 10.48550\/arXiv.1803.03735","key":"e_1_3_2_51_2","DOI":"10.48550\/arXiv.1803.03735"},{"doi-asserted-by":"publisher","key":"e_1_3_2_52_2","DOI":"10.1016\/j.physa.2011.12.021"},{"doi-asserted-by":"publisher","key":"e_1_3_2_53_2","DOI":"10.1145\/3442381.3450035"},{"doi-asserted-by":"publisher","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 10.48550\/arXiv.1710.10903","key":"e_1_3_2_54_2","DOI":"10.48550\/arXiv.1710.10903"},{"key":"e_1_3_2_55_2","first-page":"10024","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"35","author":"Verma Vikas","year":"2021","unstructured":"Vikas Verma, Meng Qu, Kenji Kawaguchi, Alex Lamb, Yoshua Bengio, Juho Kannala, and Jian Tang. 2021. GraphMix: Improved training of GNNs for semi-supervised learning. Proceedings of the AAAI Conference on Artificial Intelligence 35, 11 (May 2021), 10024\u201310032. DOI: 10.1609\/aaai.v35i11.17203"},{"issue":"4","key":"e_1_3_2_56_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3490478","article-title":"Combining graph convolutional neural networks and label propagation","volume":"40","author":"Wang Hongwei","year":"2021","unstructured":"Hongwei Wang and Jure Leskovec. 2021. Combining graph convolutional neural networks and label propagation. ACM Transactions on Information Systems 40, 4 (2021), 1\u201327.","journal-title":"ACM Transactions on Information Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_57_2","DOI":"10.1162\/qss_a_00021"},{"doi-asserted-by":"publisher","key":"e_1_3_2_58_2","DOI":"10.48550\/arXiv.2110.07190"},{"doi-asserted-by":"publisher","key":"e_1_3_2_59_2","DOI":"10.1109\/TKDE.2023.3288002"},{"key":"e_1_3_2_60_2","series-title":"Proceedings of Machine Learning Research","first-page":"40","volume-title":"Proceedings of the 33rd International Conference on Machine Learning","volume":"48","author":"Yang Zhilin","year":"2016","unstructured":"Zhilin Yang, William Cohen, and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In Proceedings of the 33rd International Conference on Machine Learning. Maria Florina Balcan and Kilian Q. Weinberger (Eds.), Proceedings of Machine Learning Research, Vol. 48, PMLR, New York, New York, 40\u201348. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.mlr.press\/v48\/yanga16.html"},{"doi-asserted-by":"publisher","key":"e_1_3_2_61_2","DOI":"10.1007\/s13042-024-02117-3"},{"key":"e_1_3_2_62_2","volume-title":"Advances in Neural Information Processing Systems","author":"Zhou Dengyong","year":"2003","unstructured":"Dengyong Zhou, Olivier Bousquet, Thomas Lal, Jason Weston, and Bernhard Sch\u00f6lkopf. 2003. Learning with local and global consistency. In Advances in Neural Information Processing Systems. S. Thrun, L. Saul, and B. Sch\u00f6lkopf (Eds.), Vol. 16, MIT Press. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/proceedings.neurips.cc\/paper_files\/paper\/2003\/file\/87682805257e619d49b8e0dfdc14affa-Paper.pdf"},{"doi-asserted-by":"publisher","key":"e_1_3_2_63_2","DOI":"10.1145\/3459637.3482488"},{"key":"e_1_3_2_64_2","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"Zhu Jiong","year":"2020","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 Advances in Neural Information Processing Systems, Vol. 33, 7793\u20137804.","journal-title":"Advances in Neural Information Processing Systems"},{"unstructured":"Xiaojin Zhu and Zoubin Ghahramani. 2002.Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107 Carnegie Mellon University Pittsburgh.","key":"e_1_3_2_65_2"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3712604","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3712604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:37Z","timestamp":1750295917000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3712604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,22]]},"references-count":64,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4,30]]}},"alternative-id":["10.1145\/3712604"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3712604","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2025,2,22]]},"assertion":[{"value":"2024-03-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}