{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T18:24:49Z","timestamp":1775154289293,"version":"3.50.1"},"reference-count":94,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:00:00Z","timestamp":1677024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"University of Catania PIACERI"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2023,6,30]]},"abstract":"<jats:p>\n            Centrality is a relevant topic in the field of network research, due to its various theoretical and practical implications. In general, all centrality metrics aim at measuring the importance of nodes (according to some definition of importance), and such importance scores are used to rank the nodes in the network, therefore the rank improvement is a strictly related topic. In a given network, the rank improvement is achieved by establishing new links, therefore the question shifts to which and how many links should be collected to get a desired rank. This problem, also known as\n            <jats:italic>link-building<\/jats:italic>\n            has been shown to be NP-hard, and most heuristics developed failed in obtaining good performance with acceptable computational complexity. In this article, we present\n            <jats:italic>LB\u2013GDM<\/jats:italic>\n            , a novel approach that leverages Geometric Deep Learning to tackle the link-building problem. To validate our proposal, 31 real-world networks were considered; tests show that\n            <jats:italic>LB\u2013GDM<\/jats:italic>\n            performs significantly better than the state-of-the-art heuristics, while having a comparable or even lower computational complexity, which allows it to scale well even to large networks.\n          <\/jats:p>","DOI":"10.1145\/3551642","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T11:59:26Z","timestamp":1663588766000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Node PageRank Improvement via Link-building using Geometric Deep Learning"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1671-840X","authenticated-orcid":false,"given":"Vincenza","family":"Carchiolo","sequence":"first","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Catania, Catania, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5841-6058","authenticated-orcid":false,"given":"Marco","family":"Grassia","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Catania, Catania, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9898-8808","authenticated-orcid":false,"given":"Alessandro","family":"Longheu","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Catania, Catania, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9279-3129","authenticated-orcid":false,"given":"Michele","family":"Malgeri","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Catania, Catania, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6910-0112","authenticated-orcid":false,"given":"Giuseppe","family":"Mangioni","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, University of Catania, Catania, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,22]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"2017. Adolescent health network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/moreno_health."},{"key":"e_1_3_3_3_2","unstructured":"2017. Advogato network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/advogato."},{"key":"e_1_3_3_4_2","unstructured":"2017. arXiv hep-ph network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/cit-HepPh."},{"key":"e_1_3_3_5_2","unstructured":"2017. arXiv hep-th network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/cit-HepTh."},{"key":"e_1_3_3_6_2","unstructured":"2017. Blogs network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/moreno_blogs."},{"key":"e_1_3_3_7_2","unstructured":"2017. Cora network dataset \u2013 KONECT. (October2017). Retrieved from http:\/\/konect.cc\/networks\/subelj_cora."},{"key":"e_1_3_3_8_2","unstructured":"2017. DBLP network dataset \u2013 KONECT. (October2017). Retrieved from http:\/\/konect.cc\/networks\/dblp-cite."},{"key":"e_1_3_3_9_2","unstructured":"2017. Epinions network dataset \u2013 KONECT. (October2017). Retrieved from http:\/\/konect.cc\/networks\/soc-Epinions1."},{"key":"e_1_3_3_10_2","unstructured":"2017. FOLDOC network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/foldoc."},{"key":"e_1_3_3_11_2","unstructured":"2017. Gnutella (31) network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/p2p-Gnutella31."},{"key":"e_1_3_3_12_2","unstructured":"2017. Google+ (NIPS) network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/ego-gplus."},{"key":"e_1_3_3_13_2","unstructured":"2017. Google.com internal network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/cfinder-google."},{"key":"e_1_3_3_14_2","unstructured":"2017. OpenFlights (Patokallio) network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/openflights."},{"key":"e_1_3_3_15_2","unstructured":"2017. Physicians network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/moreno_innovation."},{"key":"e_1_3_3_16_2","unstructured":"2017. Wikipedia elections network dataset \u2013 KONECT. (October2017). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/elec."},{"key":"e_1_3_3_17_2","unstructured":"2018. Bitcoin OTC network dataset \u2013 KONECT. (Febraury2018). Retrieved 6 July 2019 from http:\/\/konect.cc\/networks\/soc-sign-bitcoinotc."},{"key":"e_1_3_3_18_2","unstructured":"2022. The CAIDA AS Relationships Dataset. (2022). Retrieved 6 July 2019 from https:\/\/www.caida.org\/catalog\/datasets\/as-relationships\/."},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1038\/43601"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1080\/15326340600649052"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(02)00084-5"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0400087101"},{"key":"e_1_3_3_24_2","first-page":"143","volume-title":"Proceedings of the Language Technologies","author":"Batagelj V.","year":"2002","unstructured":"V. Batagelj, A. Mrvar, and M. Zaversnik. 2002. Network analysis of texts. In Proceedings of the Language Technologies. 143\u2013148."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129098"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052938"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.11.005"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48829-5_20"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.01.033"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02738-4_9"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-99626-4_1","volume-title":"Proceedings of the Intelligent Distributed Computing XII.","author":"Carchiolo V.","year":"2018","unstructured":"V. Carchiolo, M. Grassia, A. Longheu, M. Malgeri, and G. Mangioni. 2018. Long distance in-links for ranking enhancement. In Proceedings of the Intelligent Distributed Computing XII.Javier Del Ser, Eneko Osaba, Miren Nekane Bilbao, Javier J. Sanchez-Medina, Massimo Vecchio, and Xin-She Yang (Eds.), Springer International Publishing, Cham, 3\u201310."},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.12.023"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24013-3_21"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-319-01571-2_9","volume-title":"Proceedings of the Intelligent Distributed Computing VII","author":"Carchiolo Vincenza","year":"2014","unstructured":"Vincenza Carchiolo, Alessandro Longheu, Michele Malgeri, and Giuseppe Mangioni. 2014. A heuristic to explore trust networks dynamics. In Proceedings of the Intelligent Distributed Computing VII. Filip Zavoral, Jason J. Jung, and Costin Badica (Eds.), Springer International Publishing, Cham, 67\u201376."},{"issue":"1","key":"e_1_3_3_37_2","article-title":"The cost of trust in the dynamics of best attachment","volume":"34","author":"Carchiolo Vincenza","year":"2015","unstructured":"Vincenza Carchiolo, Alessandro Longheu, Michele Malgeri, and Giuseppe Mangioni. 2015. The cost of trust in the dynamics of best attachment. Computing and Informatics 34, 1 (2015), 167\u2013184.","journal-title":"Computing and Informatics"},{"key":"e_1_3_3_38_2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-319-10422-5_39","volume-title":"Proceedings of the Intelligent Distributed Computing VIII","author":"Carchiolo Vincenza","year":"2015","unstructured":"Vincenza Carchiolo, Alessandro Longheu, Michele Malgeri, and Giuseppe Mangioni. 2015. The effect of topology on the attachment process in trust networks. In Proceedings of the Intelligent Distributed Computing VIII. Springer, 377\u2013382."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2015.03.028"},{"key":"e_1_3_3_40_2","volume-title":"Proceedings of the International Conference on Social Computing, Behavioral Modeling and Prediction (Lecture Notes in Computer Science)","author":"Celli Fabio","year":"2010","unstructured":"Fabio Celli, F. Marta L. Di Lascio, Matteo Magnani, Barbara Pacelli, and Luca Rossi. 2010. Social network data and practices: The case of Friendfeed. In Proceedings of the International Conference on Social Computing, Behavioral Modeling and Prediction (Lecture Notes in Computer Science). Springer, Berlin."},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11257-015-9155-5"},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.2307\/2785979","article-title":"The diffusion of an innovation among physicians","author":"Coleman James","year":"1957","unstructured":"James Coleman, Elihu Katz, and Herbert Menzel. 1957. The diffusion of an innovation among physicians. Sociometry 20, 4 (1957), 253\u2013270.","journal-title":"Sociometry"},{"key":"e_1_3_3_43_2","unstructured":"\u00a9Google. 2019. Facts about Google and Competition. Retrieved 6 July 2019 from https:\/\/web.archive.org\/web\/20111104131332\/https:\/\/www.google.com\/competition\/howgooglesearchworks.html."},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.01.007"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1080\/00018730601170527"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-018-0493-2"},{"key":"e_1_3_3_47_2","doi-asserted-by":"crossref","unstructured":"Cristobald de Kerchove Laure Ninove and Paul Van Dooren. 2007. Maximizing PageRank via outlinks. Linear Algebra and its Applications 429 5\u20136 (2008) 1254\u20131276.","DOI":"10.1016\/j.laa.2008.01.023"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.040601"},{"key":"e_1_3_3_49_2","volume-title":"Proceedings of the ICLR Workshop on Representation Learning on Graphs and Manifolds","author":"Fey Matthias","year":"2019","unstructured":"Matthias Fey and Jan E. Lenssen. 2019. Fast graph representation learning with PyTorch geometric. In Proceedings of the ICLR Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5311-6_14"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/2542182.2542192"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1137\/140976649"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.87.278701"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-25485-8"},{"key":"e_1_3_3_55_2","first-page":"369","volume-title":"Proceedings of the International Conference on Complex Networks and Their Applications","author":"Grassia Marco","year":"2021","unstructured":"Marco Grassia and Giuseppe Mangioni. 2021. wsGAT: Weighted and signed graph attention networks for link prediction. In Proceedings of the International Conference on Complex Networks and Their Applications. Springer, 369\u2013375."},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/07\/p07008"},{"key":"e_1_3_3_58_2","volume-title":"Adaptive Methods for the Computation of PageRank","author":"Kamvar Sepandar","year":"2003","unstructured":"Sepandar Kamvar, Ar Kamvar, Taher Haveliwala, and Gene Golub. 2003. Adaptive Methods for the Computation of PageRank. Technical Report. Stanford University."},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"e_1_3_3_60_2","first-page":"221","volume-title":"Proceedings of the 16th International Conference on Data Mining.","author":"Kumar Srijan","year":"2016","unstructured":"Srijan Kumar, Francesca Spezzano, V. S. Subrahmanian, and Christos Faloutsos. 2016. Edge weight prediction in weighted signed networks. In Proceedings of the 16th International Conference on Data Mining.221\u2013230."},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526809"},{"key":"e_1_3_3_62_2","doi-asserted-by":"publisher","DOI":"10.1017\/9781316216002"},{"key":"e_1_3_3_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3363574"},{"key":"e_1_3_3_64_2","volume-title":"Proceedings of the 4th International AAAI Conference on Weblogs and Social Media.","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. 2010. Governance in social media: A case study of the Wikipedia promotion process. In Proceedings of the 4th International AAAI Conference on Weblogs and Social Media."},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217300"},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_3_67_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45735-6_1"},{"key":"e_1_3_3_68_2","first-page":"5","volume-title":"Proceedings of the International Conference on Advances in Social Networks Analysis and Mining","author":"Magnani Matteo","year":"2011","unstructured":"Matteo Magnani and Luca Rossi. 2011. The ML-model for multi-layer social networks. In Proceedings of the International Conference on Advances in Social Networks Analysis and Mining. IEEE Computer Society, 5\u201312."},{"key":"e_1_3_3_69_2","volume-title":"Formalising Trust as a Computational Concept.","author":"Marsh S.","year":"1994","unstructured":"S. Marsh. 1994. Formalising Trust as a Computational Concept.Technical Report. University of Stirling. PhD thesis."},{"key":"e_1_3_3_70_2","first-page":"658","volume-title":"Proceedings of the 9th IEEE International Conference on Dependable, Autonomic and Secure Computing.","author":"Massa Paolo","year":"2009","unstructured":"Paolo Massa, Martino Salvetti, and Danilo Tomasoni. 2009. Bowling alone and trust decline in social network sites. In Proceedings of the 9th IEEE International Conference on Dependable, Autonomic and Secure Computing.658\u2013663."},{"key":"e_1_3_3_71_2","first-page":"548","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"McAuley Julian","year":"2012","unstructured":"Julian McAuley and Jure Leskovec. 2012. Learning to discover social circles in ego networks. In Proceedings of the Advances in Neural Information Processing Systems548\u2013556."},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(01)00042-9"},{"key":"e_1_3_3_73_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_3_75_2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-540-69733-6_13","volume-title":"Proceedings of the Computing and Combinatorics.","author":"Olsen Martin","year":"2008","unstructured":"Martin Olsen. 2008. The computational complexity of link building. In Proceedings of the Computing and Combinatorics.Xiaodong Hu and Jie Wang (Eds.), Springer, Berlin, 119\u2013129."},{"key":"e_1_3_3_76_2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-13073-1_5","volume-title":"Proceedings of the Algorithms and Complexity","author":"Olsen Martin","year":"2010","unstructured":"Martin Olsen. 2010. Maximizing PageRank with new backlinks. In Proceedings of the Algorithms and Complexity, Tiziana Calamoneri and Josep Diaz (Eds.), Springer, Berlin, 37\u201348."},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.08.003"},{"key":"e_1_3_3_78_2","unstructured":"Martin Olsen Anastasios Viglas and Ilia Zvedeniouk. 2012. An approximation algorithm for the link building problem. arXiv:1204.1369. Retrieved from http:\/\/arxiv.org\/abs\/1204.1369"},{"key":"e_1_3_3_79_2","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1998. The PageRank Citation Ranking: Bringing Order to the Web. (1998). Retrieved 6 July 2019 from http:\/\/citeseer.ist.psu.edu\/article\/page98pagerank.html."},{"key":"e_1_3_3_80_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/9\/6\/186"},{"key":"e_1_3_3_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_3_82_2","first-page":"8024","volume-title":"Proceedings of the Advances in Neural Information Processing Systems.","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, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. PyTorch: An imperative style, high-performance deep learning library. In Proceedings of the Advances in Neural Information Processing Systems.H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.), Curran Associates, Inc., 8024\u20138035. Retrieved from http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf."},{"key":"e_1_3_3_83_2","doi-asserted-by":"publisher","DOI":"10.6084\/m9.figshare. 1164194"},{"key":"e_1_3_3_84_2","first-page":"351","volume-title":"Proceedings of the International Semantic Web Conference.","author":"Richardson Matthew","year":"2003","unstructured":"Matthew Richardson, Rakesh Agrawal, and Pedro Domingos. 2003. Trust management for the semantic web. In Proceedings of the International Semantic Web Conference.351\u2013368."},{"key":"e_1_3_3_85_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Richardson Mathew","year":"2002","unstructured":"Mathew Richardson and Pedro Domingos. 2002. The intelligent surfer: Probabilistic combination of link and content information in PageRank. In Proceedings of the Advances in Neural Information Processing Systems. MIT Press. Retrieved from http:\/\/citeseer.ist.psu.edu\/460350.html."},{"key":"e_1_3_3_86_2","doi-asserted-by":"crossref","unstructured":"Matei Ripeanu Ian Foster and Adriana Iamnitchi. 2002. Mapping the Gnutella network: Properties of large-scale peer- to-peer systems and implications for system design. In IIPTPS\u201901: Revised Papers from the First International Workshop on Peer-to-Peer Systems . 85\u201393.","DOI":"10.1007\/3-540-45748-8_8"},{"key":"e_1_3_3_87_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-014-9240-0"},{"key":"e_1_3_3_88_2","doi-asserted-by":"crossref","first-page":"114\u2013","DOI":"10.1016\/j.ins.2013.06.009","article-title":"Hiperion: A fuzzy approach for recommending educational activities based on the acquisition of competences","author":"Serrano-Guerrero Jesus","year":"2013","unstructured":"Jesus Serrano-Guerrero, Francisco Romero, and Jos\u00e9 Olivas. 2013. Hiperion: A fuzzy approach for recommending educational activities based on the acquisition of competences. Information Sciences 248 (2013), 114\u2013129.","journal-title":"Information Sciences"},{"key":"e_1_3_3_89_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.84.046117"},{"key":"e_1_3_3_90_2","first-page":"527","volume-title":"Proceedings of the WWW Workshop on Large Scale Network Analysis","author":"\u0160ubelj Lovro","year":"2013","unstructured":"Lovro \u0160ubelj and Marko Bajec. 2013. Model of complex networks based on citation dynamics. In Proceedings of the WWW Workshop on Large Scale Network Analysis. 527\u2013530."},{"key":"e_1_3_3_91_2","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f3 and Yoshua Bengio. 2018. Graph Attention Networks. In International Conference on Learning Representations . https:\/\/openreview.net\/forum?id=rJXMpikCZ."},{"key":"e_1_3_3_92_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-007-9021-x"},{"key":"e_1_3_3_93_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_3_94_2","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1903.03894"},{"key":"e_1_3_3_95_2","doi-asserted-by":"crossref","unstructured":"A. O. Zhirov O. V. Zhirov and D. L. Shepelyansky. 2010. Two-dimensional ranking of Wikipedia articles. Eur. Phys. J. B 77 (2010) 523.","DOI":"10.1140\/epjb\/e2010-10500-7"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551642","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3551642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:26Z","timestamp":1750186826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,22]]},"references-count":94,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6,30]]}},"alternative-id":["10.1145\/3551642"],"URL":"https:\/\/doi.org\/10.1145\/3551642","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,22]]},"assertion":[{"value":"2021-12-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}