The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Supervised random walks: predicting and recommending links in social networks
Abstract
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near future or which existing interactions are we missing. Although this problem has been extensively studied, the challenge of how to effectively combine the information from the network structure with rich node and edge attribute data remains largely open.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
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
Social Capital in the Creation of Human Capital
Coleman, J. S. (1988) · American Journal of Sociology · doi:10.1086/228943 · Cited by 26,975
Social Capital in the Creation of Human Capital
COLEMAN, J. (2000) · Knowledge and Social Capital · doi:10.1016/b978-0-7506-7222-1.50005-2 · Cited by 21,666
(1999) · Cited by 12,854
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
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
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Self-citationHierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171 · cited 2×
“Similarly, link prediction can also be used for prediction of missing or unobserved links in networks [9] or to suggest which individuals may be working together even though their interaction has yet been directly observed.”
BackgroundGroup formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Self-citationThe link prediction problem for social networks
Liben-Nowell, D., & Kleinberg, J. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956972 · Cited by 1,612
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
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 · cited 3×
“PageRank [25] and variants like Personalized PageRank [17, 15] and Random Walks with Restarts [31] are popular methods for ranking nodes on graphs.”
MethodFast Random Walk with Restart and Its Applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.70 · Cited by 1,184
Microscopic evolution of social networks
Leskovec, J., Backstrom, L., Kumar, R., & Tomkins, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401948 · Cited by 728
Self-citationInferring networks of diffusion and influence
Gomez Rodriguez, M., Leskovec, J., & Krause, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835933 · Cited by 679
Self-citationStochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 676
Link Prediction in Relational Data
Taskar, B., Wong, M.-F., Abbeel, P., & Koller, D. (2003) · Cited by 452
Inferring Networks of Diffusion and Influence
Gomez-Rodriguez, M., Leskovec, J., & Krause, A. (2012) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2086737.2086741 · Cited by 445
Self-citationGehrke, J., Ginsparg, P., & Kleinberg, J. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/980972.980992 · Cited by 281
Center-piece subgraphs: problem definition and fast solutions
Tong, H., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150448 · Cited by 264
Statistical Relational Learning for Link Prediction
Popescul, A., & Ungar, L. (2003) · Cited by 238
Inferring Networks of Diffusion and Influence
Gomez-Rodriguez, M., Leskovec, J., & Krause, A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.0234 · Cited by 235
Self-citationOptimizing classifier performance via an approximation to the Wilcoxon-Mann-Whitney statistic
Yan, L., Dodier, R. H., Mozer, M. C., & Wolniewicz, R. H. (2003) · Cited by 225
Learning to rank networked entities
Agarwal, A., Chakrabarti, S., & Aggarwal, S. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150409 · Cited by 112
Fast direction-aware proximity for graph mining
Tong, H., Faloutsos, C., & Koren, Y. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281272 · Cited by 93
Applying latent dirichlet allocation to group discovery in large graphs
Henderson, K. A., & Eliassi‐Rad, T. (2009) · ACM Symposium on Applied Computing · doi:10.1145/1529282.1529607 · Cited by 84
Learning random walks to rank nodes in graphs
Agarwal, A., & Chakrabarti, S. (2007) · International Conference on Machine Learning · doi:10.1145/1273496.1273498 · Cited by 63
A Random-Surfer Web-Graph Model
Blum, A. L., Chan, T.-H. H., & Rwebangira, M. R. (2006) · Workshop on Analytic Algorithmics and Combinatorics (ANALCO) · doi:10.1137/1.9781611972962.8 · Cited by 55
Cited by
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Self-citationFeature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
Graph convolutional networks: a comprehensive review
Zhang, S., Tong, H., Xu, J., & Maciejewski, R. (2019) · Computational Social Networks · doi:10.1186/s40649-019-0069-y · Cited by 1,888
GNNExplainer: Generating Explanations for Graph Neural Networks
Ying, R., Bourgeois, D., You, J., Zitnik, M., & Leskovec, J. (2019) · arXiv · doi:10.48550/arxiv.1903.03894 · Cited by 850
Self-citation
Metadata
- Authors
- Backstrom, L., & Leskovec, J.
- Venue
- Proceedings of the fourth ACM international conference on Web search and data mining
- Publisher
- ACM
- Published
- 2011-02-09
- Pages
- 635-644
- OpenAlex
- W2107569009
- Cited by
- 982
- References
- 29
- FWCI
- 74.87
- 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.