Fast dynamic reranking in large graphs

WWW'09 - Proceedings of the 18th International World Wide Web Conference

Volumn , Issue , 2009, Pages 31-40

  Sarkar, Purnamrita ^a   Moore, Andrew W ^b  

^a Carnegie Mellon University   (United States)

^b GOOGLE INC   (United States)

Author keywords

Harmonic function; Random walk; Search; Semi supervised learning

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; FAST DYNAMICS; GRAPH TOPOLOGY; GRAPH-THEORETIC; LARGE GRAPHS; PREDICTION TASKS; PROXIMITY MEASURE; RANDOM WALK; RE-RANKING; SAMPLING ALGORITHM; SEARCH; SEARCH RESULTS; SEMI-SUPERVISED LEARNING; USER FEEDBACK;

ALGORITHMS; BRANCH AND BOUND METHOD; HARMONIC FUNCTIONS; LINEAR PROGRAMMING; SUPERVISED LEARNING; WORLD WIDE WEB;

GRAPH THEORY;

EID: 79952391890     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1526709.1526715     Document Type: Conference Paper

References (19)

1. J. Abernethy, O. Chapelle, and C. Castillo. Web spam identification through content and hyperlinks. In Proc. AIRWEB, 2008.
2. D. Aldous and J. A. Fill. Reversible Markov Chains. 2001.
3. A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In VLDB, 2004.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proc. WWW, 1998.
5. S. Chakrabarti. Dynamic personalized pagerank in entity-relation graphs. In WWW, 2007.
6. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res., 2003.
7. L. Grady. Random walks for image segmentation. PAMI, 2006.
8. Z. Gyöngyi, H. Garcia-Molina, and J. Pedersen. Combating web spam with trustrank. In Proc. VLDB, 2004.
9. G. Jeh and J. Widom. Scaling personalized web search. In Stanford University Technical Report, 2002.
10. R. Jin, H. Valizadegan, and H. Li. Ranking refinement and its application to information retrieval. In WWW, 2008.
11. A. Joshi, R. Kumar, B. Reed, and A. Tomkins. Anchor-based proximity measures. In Proc. WWW, 2007.
12. 1/6) time, parallel algorithm for solving planar laplacians. In Proc. SODA, 2007.
13. A. Levin, D. Lischinski, and Y. Weiss. Colorization using optimization. ACM Transactions on Graphics, 2004.
14. A. Ntoulas, M. Najork, M. Manasse, and D. Fetterly. Detecting spam web pages through content analysis. In Proc. WWW, 2006.
15. P. Sarkar and A. Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In Proc. UAI, 2007.
16. P. Sarkar, A. W. Moore, and A. Prakash. Fast incremental proximity search in large graphs. In ICML, 2008.
17. D. Spielman and S. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the STOC'04, 2004.
18. Z. Xu, R. Akella, and Y. Zhang. Incorporating diversity and density in active learning for relevance feedback. In ECIR, 2007.
19. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, volume 20, 2003.