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

Citations

Publications citing this paper.
SHOWING 1-10 OF 36 CITATIONS, ESTIMATED 45% COVERAGE

79 Citations

0102030'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Intrinsic markov chains

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

Similar Papers

Loading similar papers…