The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
The link prediction problem for social networks
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 we develop approaches to link prediction based on measures for analyzing 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,680
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
A New Status Index Derived from Sociometric Analysis
Katz, L. (1953) · Psychometrika · doi:10.1007/bf02289026 · Cited by 3,866
What is research collaboration?
Katz, J. S., & Martin, B. R. (1997) · Research Policy · doi:10.1016/s0048-7333(96)00917-1 · Cited by 2,972
Friends and neighbors on the Web
Adamic, L. A., & Adar, E. (2003) · Social Networks · doi:10.1016/s0378-8733(03)00009-1 · Cited by 2,954
Clustering and preferential attachment in growing networks
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.025102 · Cited by 2,093
Evolution of the social network of scientific collaborations
Barabási, A. L., Jeong, H., Néda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00736-7 · Cited by 1,972
SimRank: a measure of structural-context similarity
Jeh, G., & Widom, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775126 · Cited by 1,925
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195
A Brief History of Generative Models for Power Law and Lognormal Distributions
Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129088 · Cited by 1,188
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Haveliwala, T. H. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1208999 · Cited by 1,052
Mapping Networks of Terrorist Cells
Krebs, V. E. (2001) · Cited by 995
Referral Web: combining social networks and collaborative filtering
Kautz, H., Selman, B., & Shah, M. (1997) · Communications of the ACM · doi:10.1145/245108.245123 · Cited by 847
Studying research collaboration using co-authorships
Melin, G., & Persson, O. (1996) · Scientometrics · doi:10.1007/bf02129600 · Cited by 611
Measures of distributional similarity
Lee, L. (1999) · Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - · doi:10.3115/1034678.1034693 · Cited by 583
Structure of growing social networks
Jin, E. M., Girvan, M., & Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.046132 · Cited by 505
Link Prediction in Relational Data
Taskar, B., Wong, M.-F., Abbeel, P., & Koller, D. (2003) · Cited by 452
Assessing experimentally derived interactions in a small world
Goldberg, D. S., & Roth, F. P. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0735871100 · Cited by 400
(2003) · Cited by 312
Emergence of a Small World from Local Interactions: Modeling Acquaintance Networks
Davidsen, J., Ebel, H., & Bornholdt, S. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.128701 · Cited by 309
The structure and function of networks
Newman, M. E. J. (2002) · Computer Physics Communications · doi:10.1016/s0010-4655(02)00201-1 · Cited by 269
ANF: a fast and scalable tool for data mining in massive graphs
Palmer, C. R., Gibbons, P. B., & Faloutsos, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775059 · Cited by 266
Statistical Relational Learning for Link Prediction
Popescul, A., & Ungar, L. (2003) · Cited by 238
An Analytical Comparison of Approaches to Personalizing PageRank
Haveliwala, T. H., Kamvar, S. D., & Jeh, G. (2003) · Cited by 181
Castro, R. D., & Grossman, J. W. (1999) · The Mathematical Intelligencer · doi:10.1007/bf03025416 · Cited by 107
Text classification from positive and unlabeled documents
Yu, H., Zhai, C., & Han, J. (2003) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/956863.956909 · Cited by 57
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Beyond the hype: Big data concepts, methods, and analytics
Gandomi, A., & Haider, M. (2015) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2014.10.007 · Cited by 4,226
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Predicting tie strength with social media
Gilbert, E., & Karahalios, K. (2009) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1518701.1518736 · Cited by 1,382
De-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.22 · Cited by 1,301
Metadata
- Authors
- Liben-Nowell, D., & Kleinberg, J.
- Venue
- Proceedings of the twelfth international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2003-11-03
- Pages
- 556-559
- OpenAlex
- W2420733993
- Cited by
- 1,612
- References
- 33
- FWCI
- 26.24
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.