Fast incremental proximity search in large graphs

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 896-903

  Sarkar, Purnamrita ^a   Moore, Andrew W ^a   Prakash, Amit ^b  

^a Carnegie Mellon University   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING; RANDOM PROCESSES; LEARNING SYSTEMS; QUERY PROCESSING;

HIGH PROBABILITY; LINK PREDICTION; PERSONALIZED PAGERANK; PROXIMITY MEASURE; PRUNING ALGORITHMS; RANKING PROBLEMS; SAMPLING TECHNIQUE; SHORT-TERM BEHAVIOR; CITATION GRAPHS; EMPIRICAL RESULTS; HIGH PROBABILITIES; LARGE GRAPHS; LINK PREDICTIONS; ON THE FLIES; PAGE RANKS; PROCESSING TIME; PROXIMITY MEASURES; QUERY TIME; RANDOM WALKS; SAMPLING TECHNIQUES; SHORT-TERM BEHAVIORS;

QUERY PROCESSING; ROBOT LEARNING;

EID: 56449118595     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390269     Document Type: Conference Paper

References (13)

1. Aldous, D., & Fill, J. A. (2001). Reversible markov chains.
2. Balmin, A., Hristidis, V., & Papakonstantinou, Y. (2004). ObjectRank: Authority-based keyword search in databases. VLDB, 2004.
3. Brand, M. (2005). A Random Walks Perspective on Maximizing Satisfaction and Profit. SIAM '05.
4. Chakrabarti, S. (2007). Dynamic personalized pagerank in entity-relation graphs. WWW '07 (pp. 571-580). New York, NY, USA: ACM Press.
5. Fogaras, D., Rácz, B., Csalogány, K., & Sarlós, T. (2004). Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments.
6. Haveliwala, T. (2002). Topic-sensitive pagerank. WWW.
7. Jeh, G., & Widom, J. (2002a). Scaling personalized web search. Stanford University Technical Report.
8. Jeh, G., & Widom, J. (2002b). Simrank: A measure if structural-context similarity. KDD.
9. Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika.
10. Liben-Nowell, D., & Kleinberg, J. (2003). The link prediction problem for social networks. CIKM '03.
11. Sarkar, P., & Moore, A. (2007). A tractable approach to finding closest truncated-commute-time neighbors in large graphs. Proc. UAI.
12. Spielman, D., & Srivastava, N. (2008). Graph sparsification by effective resistances. Proceedings of the STOC'08.
13. Tong, H., Koren, Y., & Faloutsos, C. (2007). Fast direction-aware proximity for graph mining. Proc. KDD.