Skip to main content

Advertisement

Log in

Link prediction using betweenness centrality and graph neural networks

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Social networks are widely considered as the most important tool to connect people. The last century saw a massive increase in the number of links between users. Many nodes and/or edges are included or removed repeatedly as time passes. In order to understand the patterns of relations among people or organizations, social network analysis (SNA) sheds light on users and links dynamics. Link prediction (LP) is one of the most important research areas of SNA. The main objective of link prediction is to determine whether two nodes will form a link or not in the future. LP uses similarity-based methods such as common neighbors, resource allocation, and Adamic–Adar metrics to forecast potential connections from the current state of networks. Although using the similarity-based methods is highly time efficient, the measures still suffer from low accuracy. The main focus of this paper is to address this drawback by defining a new metric called LSBC that uses the combination of a similarity metric and the betweenness centrality which defines the node’s power over the entire network. The method was illustrated with nine datasets from different types of networks. Experiments show that LSBC captures the similarity of a pair of nodes accurately and surpasses all the state-of-the-arts methods. Furthermore, we use neural network model to address the link prediction as a classification task. The results show that the adding LSBC as additional feature increases the accuracy and reduces the cross-entropy loss.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • https://github.com/axe-331/LinkPrediction-using-Betweenness-centrality

  • Adamic LA, Adar E (2003) Friends and neighbors on the web. Social Netw 25(3):211–230

    Article  Google Scholar 

  • Aghabozorgi F, Khayyambashi MR (2018) A new similarity measure for link prediction based on local structures in social networks. Phys A Stat Mech Appl 501:12–23

    Article  Google Scholar 

  • Ahmad I, Akhtar MU, Noor S, Shahnaz A (2020) Missing link prediction using common neighbor and centrality based parameterized algorithm. Sci Rep 10(1):1–9

    Google Scholar 

  • Al Hasan M, Chaoji V, Salem S, Zaki M (2006) Link prediction using supervised learning. In: SDM06: workshop on link analysis, counter-terrorism and security, vol. 30, pp 798–805

  • Al Hasan M, Zaki MJ (2011) A survey of link prediction in social networks. In: Social network data analytics, pp 243–275. Springer, Boston, MA

  • Ayoub J, Lotfi D, Hammouch A (2022) Mean received resources meet machine learning algorithms to improve link prediction methods. Information 13(1):35

    Article  Google Scholar 

  • Aziz F, Gul H, Muhammad I, Uddin I (2020) Link prediction using node information on local paths. Phys A Stat Mech Appl 557:124980

    Article  Google Scholar 

  • Backstrom L, Leskovec J (2011) Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the fourth ACM international conference on Web search and data mining, pp. 635–644

  • Barabâsi AL, Jeong H, N’eda Z, Ravasz E, Schubert A, Vicsek T (2002) Evolution of the social network of scientific collaborations. PhysicaA: Stat Mech Appl 311(3–4):590–614

    Article  MathSciNet  Google Scholar 

  • Bhardwaj S, Niyogi R, Milani A (2011, June) Performance analysis of an algorithm for computation of betweenness centrality. In: International conference on computational science and its applications, pp 537–546. Springer, Berlin, Heidelberg

  • Bruna J, Zaremba W, Szlam A, LeCun Y (2013) Spectral networks and locally connected networks on graphs. arXiv preprint http://arxiv.org/abs/arXiv:1312.6203

  • Cannistraci CV, Alanis-Lobato G, Ravasi T (2013) From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks. Sci Rep 3(1):1–14

    Article  Google Scholar 

  • Chen H, Li X, Huang Z (2005, June) Link prediction approach to collaborative filtering. In: Proceedings of the 5th ACM/IEEE-CS joint conference on digital libraries (JCDL’05), pp 141–142. IEEE

  • Fouss F, Pirotte A, Renders J, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355–369

    Article  Google Scholar 

  • Freeman L (1977) A set of measures of centrality based upon betweenness. Sociometry. 40(1):35–41. https://doi.org/10.2307/3033543 (JSTOR 3033543)

    Article  Google Scholar 

  • Gu S, Chen L (2016, November) Link prediction based on precision optimization. In: International conference on geo-informatics in resource management and sustainable ecosystem, pp. 131–141, Springer, Singapore

  • Hanneke S, Xing EP (2009) Network completion and survey sampling. In: Artificial intelligence and statistics, pp 209–215. PMLR

  • Jaccard P (1901) Etude comparative de la distribution florale dans une portion des Alpes et des Jura. Bull Soc Vaudoise Sci Nat 37:547–579

    Google Scholar 

  • Jeh G, Widom J (2002, July) Simrank: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 538–543

  • Karim A, Azam S, Shanmugam B, Kannoorpatti K, Alazab M (2019) A comprehensive survey for intelligent spam email detection. IEEE Access 7:168261–168295

    Article  Google Scholar 

  • Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39–43

    Article  Google Scholar 

  • Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: a survey. Phys A Stat Mech Appl 553:124289

    Article  MathSciNet  Google Scholar 

  • Lee YL, Zhou T (2021) Collaborative filtering approach to link prediction. Phys A Stat Mech Appl 578:126107

    Article  Google Scholar 

  • Leicht EA, Holme P, Newman ME (2006) Vertex similarity in networks. Phys. Rev. E 73(2):026120

    Article  Google Scholar 

  • Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539–547

  • Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Tech 58(7):1019–1031

    Article  Google Scholar 

  • Liu W, Lü L (2010) Link prediction based on local random walk. EPL (Europhysics Letters) 89(5):58007

    Article  Google Scholar 

  • Li P, Wang Y, Wang H, Leskovec J (2020) Distance encoding: Design provably more powerful neural networks for graph representation learning. arXiv preprint http://arxiv.org/abs/arXiv:2009.00142

  • Murphy KP (2012) Machine learning: a probabilistic perspective. MIT Press, Cambridge

    Google Scholar 

  • Negyessy L, Nepusz T, Kocsis L, Bazso F (2006) Prediction of the main cortical areas and connections involved in the tactile function of the visual cortex by network analysis. Eur J Neurosci 23(7):1919–1930

    Article  Google Scholar 

  • Newman ME (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64(2):025102

    Article  Google Scholar 

  • Niepert M, Ahmed M, Kutzkov K (2016, June) Learning convolutional neural networks for graphs. In: International conference on machine learning, pp 2014–2023. PMLR

  • Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási AL (2002) Hierarchical organization of modularity in metabolic networks. Science 297(5586):1551–1555

    Article  Google Scholar 

  • Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: AAAI. http://networkrepository.com

  • Salton G, McGill MJ (1986) Introduction to modern information retrieval

  • Sorensen TA (1948) A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons. Biol. Skar. 5:1–34

    Google Scholar 

  • Wu M, Wu S, Zhang Q, Xue C, Kan H, Shao F (2019) Enhancing link prediction via network reconstruction. Phys A Stat Mech Appl 534:122346

    Article  Google Scholar 

  • Zhang M, Li P, Xia Y, Wang K, Jin L (2021) Revisiting graph neural networks for link prediction. arXiv preprint http://arxiv.org/abs/arXiv:2010.16103

  • Zhou T, Lu L, Zhang YC (2009) Predicting missing links via local information. European Phys J B 71(4):623–630

    Article  Google Scholar 

  • Zhou T, Lee YL, Wang G (2021) Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms. Phys A Stat Mech Appl 564:125532

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Contributions

Authors JA, DL and AH: wrote the main manuscript text. All authors reviewed the manuscript.

Corresponding author

Correspondence to Jibouni Ayoub.

Ethics declarations

Conflict of interest

The authors declare no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ayoub, J., Lotfi, D. & Hammouch, A. Link prediction using betweenness centrality and graph neural networks. Soc. Netw. Anal. Min. 13, 5 (2023). https://doi.org/10.1007/s13278-022-00999-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-022-00999-1

Keywords

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy