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.
Keywords
Snapshot (computer storage)Computer scienceRandom walkNode (physics)Artificial intelligenceEvolving networksData miningTheoretical computer scienceMachine learningData scienceComplex networkMathematicsWorld Wide WebStatistics
Affiliated Institutions
Related Publications
A survey on Image Data Augmentation for Deep Learning
Abstract Deep convolutional neural networks have performed remarkably well on many Computer Vision tasks. However, these networks are heavily reliant on big data to avoid overfi...
Publication Info
- Year
- 2011
- Type
- article
- Pages
- 635-644
- Citations
- 994
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
994
OpenAlex
Cite This
Lars Bäckström,
Jure Leskovec
(2011).
Supervised random walks.
, 635-644.
https://doi.org/10.1145/1935826.1935914
Identifiers
- DOI
- 10.1145/1935826.1935914