Affiliation:
1. Department of Electrical, Electronic and Computer Engineering, University of Catania, Catania, Italy
Abstract
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
link-building
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
LB–GDM
, 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
LB–GDM
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.
Funder
University of Catania PIACERI
Publisher
Association for Computing Machinery (ACM)
Reference94 articles.
1. 2017. Adolescent health network dataset – KONECT. (October2017). Retrieved 6 July 2019 from http://konect.cc/networks/moreno_health.
2. 2017. Advogato network dataset – KONECT. (October2017). Retrieved 6 July 2019 from http://konect.cc/networks/advogato.
3. 2017. arXiv hep-ph network dataset – KONECT. (October2017). Retrieved 6 July 2019 from http://konect.cc/networks/cit-HepPh.
4. 2017. arXiv hep-th network dataset – KONECT. (October2017). Retrieved 6 July 2019 from http://konect.cc/networks/cit-HepTh.
5. 2017. Blogs network dataset – KONECT. (October2017). Retrieved 6 July 2019 from http://konect.cc/networks/moreno_blogs.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献