Skip to main content

A Method of Link Prediction Based on Betweenness

  • Conference paper
  • First Online:
Book cover Computational Social Networks (CSoNet 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9197))

Included in the following conference series:

Abstract

Link prediction in complex networks has attracted increasing attention of researchers in many domains. The prediction methods are usually used to find missing information, identify spurious interactions, and reconstruct networks. Inspired by the rich-get-richer mechanism, we propose a novel index on the basis of betweenness. Extensive experiments show that the proposed method performs well on some networks. Especially, on the Adjnoun network and Florida network, it outperforms some mainstream link prediction baselines, such as CN Index, AA Index and RA Index.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zhou, T., Lü, L., Zhang, Y.-C.: Predicting missing links via local information. Eur. Phy. B 71, 623–630 (2009)

    Article  MATH  Google Scholar 

  2. Lü, L., Zhou, T.: Link prediction in complex networks: a survey. Physica A 390, 1150–1170 (2011)

    Article  Google Scholar 

  3. Sales-Pardo, M., Guimer, R., Amaral, L.A.N.: Extracting the hierarchical organization of complex systems. Proc. Natl. Acad. Sci. USA 104, 15224 (2007)

    Article  Google Scholar 

  4. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Newman, M.E.J.: Clustering and preferential attachment in growing networks. Phys. Rev. E 64, 025102 (2001)

    Article  Google Scholar 

  6. Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Networks 25, 211 (2003)

    Article  Google Scholar 

  7. Airoldi, E.M., Blei, D.M., Fienberg, S.E., Xing, X.P.: Mixed-membership stochastic blockmodels. J. Mach. Learn. Res. 9, 1981 (2008)

    MATH  Google Scholar 

  8. Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453, 98 (2008)

    Article  Google Scholar 

  9. Xie, Z., Dong, E., Li, J., Kong, D., Wu, N.: Potential links by neighbor communities. Physica A 406(C), 244–252 (2014)

    Article  Google Scholar 

  10. Dong, E., Li, J., Xie, Z.: Link Prediction via Convex Nonnegative Matrix Factorization on Multiscale Blocks. Journal of Applied Mathematics 2014 (2014)

    Google Scholar 

  11. Hanneman, R.A., Riddle, M.: Introduction to Social Network Methods. University of California (2005)

    Google Scholar 

  12. Freeman, L.C.: Centrality in networks: I. Conceptual clarification. Social Networks 1(C), 215–239 (1979)

    Google Scholar 

  13. Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25(2), 163–177 (2001)

    Article  MATH  Google Scholar 

  14. Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)

    Google Scholar 

  15. Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Preprint physics, 0605087 (2006)

    Google Scholar 

  16. Melián, C.J., Bascompte, J.: Food web cohesion. Ecology 85, 352–358 (2004)

    Article  Google Scholar 

  17. Batageli, V., Mrvar, A.: Pajek Datasets. http://vlado.fmf.unilj.si/pub/networks/data/default.htm

  18. Davis, T., Hu, Y.: The University of Florida Sparse Matrix Collection. http://www.cise.ufl.edu/research/sparse/matrices/

  19. Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68, 065103 (2003)

    Article  Google Scholar 

  20. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-worldnetworks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  21. Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002)

    Article  Google Scholar 

  22. Hand, D.J., Till, R.J.: A simple generalisation of the area under the ROC curve for multiple class classification problems. Mach. Learn. 45, 171–186 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pengyuan Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, P., Li, J., Dong, E., Liu, Q. (2015). A Method of Link Prediction Based on Betweenness. In: Thai, M., Nguyen, N., Shen, H. (eds) Computational Social Networks. CSoNet 2015. Lecture Notes in Computer Science(), vol 9197. Springer, Cham. https://doi.org/10.1007/978-3-319-21786-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21786-4_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21785-7

  • Online ISBN: 978-3-319-21786-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics