skip to main content
10.1145/2567948.2580049acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

A novel link prediction approach for scale-free networks

Published:07 April 2014Publication History

ABSTRACT

The link prediction problem is to predict the existence of a link between every node pair in the network based on the past observed networks arising in many practical applications such as recommender systems, information retrieval, and the marketing analysis of social networks. Here, we propose a new mathematical programming approach for predicting a future network utilizing the node degree distribution identified from historical observation of the past networks. We develop an integer programming problem for the link prediction problem, where the objective is to maximize the sum of link scores (probabilities) while respecting the node degree distribution of the networks. The performance of the proposed framework is tested on the real-life Facebook networks. The computational results show that the proposed approach can considerably improve the performance of previously published link prediction methods.

References

  1. L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211--230, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  2. M. Al Hasan, V. Chaoji, S. Salem, and M. Zaki. Link prediction using supervised learning. In SDM'06: Workshop on Link Analysis, Counter-terrorism and Security. Citeseer, 2006.Google ScholarGoogle Scholar
  3. R. Anstee. A polynomial algorithm for b-matchings: an alternative approach. Information Processing Letters, 24(3):153--157, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Bader, A. Chaudhuri, J. Rothberg, and J. Chant. Gaining confidence in high-throughput protein interaction networks. Nature biotechnology, 22(1):78--85, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  5. A. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  6. A. L. Barabasi, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek. Evolution of the social network of scientific collaborations. Physica a-Statistical Mechanics and Its Applications, 311(3--4):590--614, 2002.Google ScholarGoogle Scholar
  7. V. Boginski, S. Butenko, and P. Pardalos. Mining market data: a network approach. Computers & Operations Research, 33(11):3171--3184, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Bradley. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition, 30(7):1145--1159, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Clauset, C. Moore, and M. Newman. Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191):98--101, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  10. W. Cook and W. Pulleyblank. Linear systems for constrained matching problems. Mathematics of Operations Research, 12(1):97--120, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Z. Huang, X. Li, and H. Chen. Link prediction approach to collaborative filtering. In Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries, pages 141--142. ACM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A. Barabási. The large-scale organization of metabolic networks. Nature, 407(6804):651--654, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  13. B. Karrer and M. Newman. Stochastic blockmodels and community structure in networks. Physical Review E, 83(1):016107, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  14. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39--43, 1953.Google ScholarGoogle ScholarCross RefCross Ref
  15. H. Kim, I. Kim, Y. Lee, and B. Kahng. Scale-free network in stock markets. Journal of Korean Physical Society, 40:1105--1108, 2002.Google ScholarGoogle Scholar
  16. D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019--1031, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. L. Lu and T. Zhou. Link prediction in complex networks: A survey. Arxiv preprint arXiv:1010.0725, 2010.Google ScholarGoogle Scholar
  18. C. Manning, P. Raghavan, H. Schütze, and E. Corporation. Introduction to information retrieval, volume 1. Cambridge University Press Cambridge, UK, 2008. Google ScholarGoogle ScholarCross RefCross Ref
  19. A. Medina, I. Matta, and J. Byers. On the origin of power laws in Internet topologies. ACM SIGCOMM Computer Communication Review, 30(2):18--28, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. E. J. Newman. Clustering and preferential attachment in growing networks. Physical Review E, 64(2):025102, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  21. M. E. J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the United States of America, 98(2):404--409, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  22. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167--256, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. G. Salton. Automatic text processing: the transformation. Analysis and Retrieval of Information by Computer, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. J. Shetty and J. Adibi. The Enron email dataset database schema and brief statistical report. Information Sciences Institute Technical Report, 2004.Google ScholarGoogle Scholar
  25. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN'09), August 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. S. Zhou and R. Mondragón. Accurately modeling the Internet topology. Physical Review E, 70(6):066108, 2004.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A novel link prediction approach for scale-free networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide Web
          April 2014
          1396 pages
          ISBN:9781450327459
          DOI:10.1145/2567948

          Copyright © 2014 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 7 April 2014

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate1,899of8,196submissions,23%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader