The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Local Probabilistic Models for Link Prediction
Abstract
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented the social network in the form of a graph and has leveraged topological and semantic measures of similarity between two nodes to evaluate the probability of link formation. Here we introduce a novel local probabilistic graphical model method that can scale to large graphs to estimate the joint co-occurrence probability of two nodes. Such a probability measure captures information that is not captured by either topological measures or measures of semantic similarity, which are the dominant measures used for link prediction. We demonstrate the effectiveness of the co-occurrence probability feature by using it both in isolation and in combination with other topological and semantic features for predicting co-authorship collaborations on real datasets.
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
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
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
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
Statistical Methods for Speech Recognition
Sun, D. X., & Jelinek, F. (1999) · Journal of the American Statistical Association · doi:10.2307/2670189 · Cited by 1,946
The 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
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Self-citationLink prediction using supervised learning
Hasan, M. A., Chaoji, V., Salem, S., & Zaki, M. J. (2006) · Cited by 812
Link Prediction in Relational Data
Taskar, B., Wong, M.-F., Abbeel, P., & Koller, D. (2003) · Cited by 452
Statistical Relational Learning for Link Prediction
Popescul, A., & Ungar, L. (2003) · Cited by 238
Prediction and ranking algorithms for event-based network data
O'Madadhain, J., Hutchins, J., & Smyth, P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117458 · Cited by 218
A Parameterized Probabilistic Model of Network Evolution for Supervised Link Prediction
Kashima, H., & Abe, N. (2006) · Proceedings · doi:10.1109/icdm.2006.8 · Cited by 144
The case for anomalous link discovery
Rattigan, M. J., & Jensen, D. D. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117460 · Cited by 128
Link Prediction Based on Graph Topology: The Predictive Value of Generalized Clustering CoefficientPreprint
Huang, Z. (2010) · SSRN Electronic Journal · doi:10.2139/ssrn.1634014 · Cited by 125
Summarizing itemset patterns using probabilistic models
Wang, C., & Parthasarathy, S. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150495 · Cited by 98
Self-citationBeyond independence: probabilistic models for query approximation on binary transaction data
Pavlov, D., Mannila, H., & Smyth, P. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1245281 · Cited by 80
Depth-First Non-Derivable Itemset Mining
Calders, T., & Goethals, B. (2005) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.23 · Cited by 56
Cited by
A Survey of Link Prediction in Complex Networks
Martínez, V., Berzal, F., & Cubero, J.-C. (2017) · ACM Computing Surveys · doi:10.1145/3012704 · Cited by 695
Human mobility, social ties, and link prediction
Wang, D., Pedreschi, D., Song, C., Giannotti, F., & Barabasi, A.-L. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020581 · Cited by 665
New perspectives and methods in link prediction
Lichtenwalter, R. N., Lussier, J. T., & Chawla, N. V. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835837 · Cited by 664
A Survey of Link Prediction in Social Networks
Hasan, M. A., & Zaki, M. J. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_9 · Cited by 566
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
Metadata
- Authors
- Wang, C., Satuluri, V., & Parthasarathy, S.
- Venue
- Seventh IEEE International Conference on Data Mining (ICDM 2007)
- Publisher
- IEEE
- Published
- 2007-10
- Pages
- 322-331
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2125082260
- Cited by
- 314
- References
- 20
- FWCI
- 5.05
- 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.