{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:39:12Z","timestamp":1787319552878,"version":"3.56.0"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T00:00:00Z","timestamp":1707782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"REFSA: Machine Learning-based Systems for the Automation of Systematic Literature Reviews in the Food Safety Domain"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>In this article, we present a new propagation paradigm based on the principle of Hyperlink-Induced Topic Search (HITS) algorithm. The HITS algorithm utilizes the concept of a \u201cself-reinforcing\u201d relationship of authority-hub. Using HITS, the centrality of nodes is determined via repeated updates of authority-hub scores that converge to a stationary distribution. Unlike PageRank-based propagation methods, which rely solely on the idea of authorities (in-links), HITS considers the relevance of both authorities (in-links) and hubs (out-links), thereby allowing for a more informative graph learning process. To segregate node prediction and propagation, we use a Multilayer Perceptron in combination with a HITS-based propagation approach and propose two models: HITS-GNN and HITS-GNN+. We provided additional validation of our models\u2019 efficacy by performing an ablation study to assess the performance of authority-hub in independent models. Moreover, the effect of the main hyper-parameters and normalization is also analyzed to uncover how these techniques influence the performance of our models. Extensive experimental results indicate that the proposed approach significantly improves baseline methods on the graph (citation network) benchmark datasets by a decent margin for semi-supervised node classification, which can aid in predicting the categories (labels) of scientific articles not exclusively based on their content but also based on the type of articles they cite.<\/jats:p>","DOI":"10.1145\/3638779","type":"journal-article","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T10:57:21Z","timestamp":1703933841000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["HITS-based Propagation Paradigm for Graph Neural Networks"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8959-6872","authenticated-orcid":false,"given":"Mehak","family":"Khan","sequence":"first","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Lab, Oslo Metropolitan University, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0333-0454","authenticated-orcid":false,"given":"Gustavo B. M.","family":"Mello","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Lab, Oslo Metropolitan University, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5955-9672","authenticated-orcid":false,"given":"Laurence","family":"Habib","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Lab, Oslo Metropolitan University, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8371-927X","authenticated-orcid":false,"given":"Paal","family":"Engelstad","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Lab, Oslo Metropolitan University, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7591-1659","authenticated-orcid":false,"given":"Anis","family":"Yazidi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Lab, Oslo Metropolitan University, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,2,13]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"841","volume-title":"Uncertainty in Artificial Intelligence","author":"Abu-El-Haija Sami","year":"2020","unstructured":"Sami Abu-El-Haija, Amol Kapoor, Bryan Perozzi, and Joonseok Lee. 2020. N-GCN: Multi-scale graph convolution for semi-supervised node classification. In Uncertainty in Artificial Intelligence. PMLR, 841\u2013851."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.10.022"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052938"},{"key":"e_1_3_1_5_2","first-page":"1026","volume-title":"International Conference on Machine Learning","author":"Bodnar Cristian","year":"2021","unstructured":"Cristian Bodnar, Fabrizio Frasca, Yuguang Wang, Nina Otter, Guido F. Montufar, Pietro Lio, and Michael Bronstein. 2021. Weisfeiler and lehman go topological: Message passing simplicial networks. In International Conference on Machine Learning. PMLR, 1026\u20131037."},{"key":"e_1_3_1_6_2","article-title":"Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking","author":"Bojchevski Aleksandar","year":"2017","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2017. Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking. arXiv:1707.03815. Retrieved from https:\/\/arxiv.org\/abs\/1707.03815","journal-title":"arXiv:1707.03815"},{"key":"e_1_3_1_7_2","volume-title":"Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD\u201919) and the International Workshop on Mining and Learning with Graphs (MLG Workshop\u201919)","author":"Bojchevski Aleksandar","year":"2019","unstructured":"Aleksandar Bojchevski, Johannes Klicpera, Bryan Perozzi, Martin Blais, Amol Kapoor, Michal Lukasik, and Stephan G\u00fcnnemann. 2019. Is pagerank all you need for scalable graph neural networks? In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD\u201919) and the International Workshop on Mining and Learning with Graphs (MLG Workshop\u201919)."},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.3390\/s21041275"},{"key":"e_1_3_1_10_2","article-title":"Residual gated graph convnets","author":"Bresson Xavier","year":"2017","unstructured":"Xavier Bresson and Thomas Laurent. 2017. Residual gated graph convnets. arXiv:1711.07553. Retrieved from https:\/\/arxiv.org\/abs\/1711.07553","journal-title":"arXiv:1711.07553"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_1_12_2","article-title":"Fastgcn: Fast learning with graph convolutional networks via importance sampling","author":"Chen Jie","year":"2018","unstructured":"Jie Chen, Tengfei Ma, and Cao Xiao. 2018. Fastgcn: Fast learning with graph convolutional networks via importance sampling. arXiv:1801.10247. Retrieved from https:\/\/arxiv.org\/abs\/1801.10247","journal-title":"arXiv:1801.10247"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.12.130"},{"key":"e_1_3_1_14_2","first-page":"9936","article-title":"On provable benefits of depth in training graph convolutional networks","volume":"34","author":"Cong Weilin","year":"2021","unstructured":"Weilin Cong, Morteza Ramezani, and Mehrdad Mahdavi. 2021. On provable benefits of depth in training graph convolutional networks. Adv. Neural Inf. Process. Syst. 34 (2021), 9936\u20139949.","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052613"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-023-00624-6"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463059"},{"key":"e_1_3_1_18_2","first-page":"1263","volume-title":"International Conference on Machine Learning","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 International Conference on Machine Learning. PMLR, 1263\u20131272."},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/1958573.1958588"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"e_1_3_1_21_2","first-page":"1844","volume-title":"International Conference in Communications, Signal Processing, and Systems","author":"Guan Mengmeng","year":"2020","unstructured":"Mengmeng Guan and Bo Ning. 2020. A brief survey of graph ranking methods. In International Conference in Communications, Signal Processing, and Systems. Springer, 1844\u20131848."},{"key":"e_1_3_1_22_2","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Adv. Neural Inf. Process. Syst. 30 (2017).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10020815"},{"key":"e_1_3_1_26_2","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. Retrieved from https:\/\/arxiv.org\/abs\/1609.02907","journal-title":"arXiv:1609.02907"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_1_28_2","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","author":"Klicpera Johannes","year":"2018","unstructured":"Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv:1810.05997. Retrieved from https:\/\/arxiv.org\/abs\/1810.05997","journal-title":"arXiv:1810.05997"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.02.025"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623745"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1501-236"},{"key":"e_1_3_1_35_2","first-page":"1","volume-title":"Proceedings of the 10th International Workshop on Mining and Learning with Graphs","volume":"8","author":"Namata Galileo","year":"2012","unstructured":"Galileo Namata, Ben London, Lise Getoor, Bert Huang, and U Edu. 2012. Query-driven active surveying for collective classification. In Proceedings of the 10th International Workshop on Mining and Learning with Graphs, Vol. 8. 1."},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/383952.384003"},{"key":"e_1_3_1_37_2","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web.","author":"Page Lawrence","year":"1999","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_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"e_1_3_1_40_2","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv:1811.05868. Retrieved from https:\/\/arxiv.org\/abs\/1811.05868","journal-title":"arXiv:1811.05868"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-019-05855-6"},{"key":"e_1_3_1_42_2","article-title":"Message passing all the way up","author":"Veli\u010dkovi\u0107 Petar","year":"2022","unstructured":"Petar Veli\u010dkovi\u0107. 2022. Message passing all the way up. preprint arXiv:2202.11097. Retrieved from https:\/\/arxiv.org\/abs\/2202.11097","journal-title":"preprint arXiv:2202.11097"},{"key":"e_1_3_1_43_2","first-page":"20","article-title":"Graph attention networks","volume":"1050","author":"Velickovic Petar","year":"2017","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. Stat 1050 (2017), 20.","journal-title":"Stat"},{"key":"e_1_3_1_44_2","first-page":"6861","volume-title":"International Conference on Machine Learning","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In International Conference on Machine Learning. PMLR, 6861\u20136871."},{"key":"e_1_3_1_45_2","article-title":"How powerful are graph neural networks?","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv:1810.00826. Retrieved from https:\/\/arxiv.org\/abs\/1810.00826","journal-title":"arXiv:1810.00826"},{"key":"e_1_3_1_46_2","first-page":"5453","volume-title":"International Conference on Machine Learning","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 International Conference on Machine Learning. PMLR, 5453\u20135462."},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/1255175.1255221"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939804"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3119140"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3185149"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.06.082"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2673241"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-55209-3_1"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512159"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.5555\/1104523"},{"key":"e_1_3_1_56_2","first-page":"912","volume-title":"Proceedings of the 20th International conference on Machine learning (ICML\u201903)","author":"Zhu Xiaojin","year":"2003","unstructured":"Xiaojin Zhu, Zoubin Ghahramani, and John D. Lafferty. 2003. Semi-supervised learning using Gaussian fields and harmonic functions. In Proceedings of the 20th International conference on Machine learning (ICML\u201903). 912\u2013919."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638779","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:03:34Z","timestamp":1750277014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,13]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3638779"],"URL":"https:\/\/doi.org\/10.1145\/3638779","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,13]]},"assertion":[{"value":"2023-04-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-15","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}