A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Supervised random walks
2011
Proceedings of the fourth ACM international conference on Web search and data mining - WSDM '11
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. We
doi:10.1145/1935826.1935914
dblp:conf/wsdm/BackstromL11
fatcat:5glee4eo5rfbfb6sug5vxifvnm