Link prediction: the power of maximal entropy random walk

@inproceedings{Li2011LinkPT,
  title={Link prediction: the power of maximal entropy random walk},
  author={Rong-Hua Li and Jeffrey Xu Yu and Jianquan Liu},
  booktitle={CIKM},
  year={2011}
}
Link prediction is a fundamental problem in social network analysis. The key technique in unsupervised link prediction is to find an appropriate similarity measure between nodes of a network. A class of wildly used similarity measures are based on random walk on graph. The traditional random walk (TRW) considers the link structures by treating all nodes in a network equivalently, and ignores the centrality of nodes of a network. However, in many real networks, nodes of a network not only prefer… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS
28 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Intrinsic markov chains

  • W. PARRY
  • Transactions of the American Mathematical Society…
  • 1964
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…