Fast Dynamic Reranking in Large Graphs cs快速动态排序中大的图 CS.cmu.pptVIP

Fast Dynamic Reranking in Large Graphs Purnamrita Sarkar Andrew Moore Talk Outline Ranking in graphs Reranking in graphs Harmonic functions for reranking Efficient algorithms Results Graphs are everywhere The world wide web Publications - Citeseer, DBLP Friendship networks – Facebook Graph Search: underlying question Given a query node, return k other nodes which are most similar to it Need a graph theoretic measure of similarity minimum number of hops (Not robust enough) average number of hops (huge number of paths!) probability of reaching a node in a random walk Graph Search: und