a truncate random walk starting from it the probability of hitting a relevant node before an irrelevant one is large. Here below an example.
.
Monday, April 27, 2009
Fast Dynamic Reranking in Large Graphs
Fast Dynamic Reranking in Large Graphs is a google paper for learning a ranking function of a graph based on positive and negative votes given to a subset of nodes. A node is ranked high if in
a truncate random walk starting from it the probability of hitting a relevant node before an irrelevant one is large. Here below an example.
.
a truncate random walk starting from it the probability of hitting a relevant node before an irrelevant one is large. Here below an example.
.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment