The link prediction problem for social networks
Top Cited Papers
- 3 November 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 556-559
- https://doi.org/10.1145/956863.956972
Abstract
Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link prediction problem, and develop approaches to link prediction based on measures the "proximity" of nodes in a network. Experiments on large co-authorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.Keywords
This publication has 11 references indexed in Scilit:
- Friends and neighbors on the WebPublished by Elsevier ,2003
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Social networks: from the Web to the enterpriseIEEE Internet Computing, 2002
- SimRankPublished by Association for Computing Machinery (ACM) ,2002
- Evolution of the social network of scientific collaborationsPublished by Elsevier ,2002
- Measures of distributional similarityPublished by Association for Computational Linguistics (ACL) ,1999
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998
- Referral WebCommunications of the ACM, 1997
- Indexing by latent semantic analysisJournal of the American Society for Information Science, 1990
- A new status index derived from sociometric analysisPsychometrika, 1953