Fast nearest-neighbor search in disk-resident graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 513-522

  Sarkar, Purnamrita ^a   Moore, Andrew W ^b  

^a Carnegie Mellon University   (United States)

^b GOOGLE INC   (United States)

Author keywords

External memory; Graphs; Link prediction; Random walks

Indexed keywords

APPROXIMATION ERRORS; CITESEER; CLUSTER BOUNDARIES; CLUSTERED GRAPH; DATA FILES; DETERMINISTIC ALGORITHMS; EMPIRICAL RESULTS; EXTERNAL MEMORY; FRAUD DETECTION; FUNDAMENTAL PROBLEM; GRAPH MINING; GRAPH SEARCH; GRAPHS; HIGH-DEGREE NODES; LINK PREDICTION; MEMORY-RESIDENT; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; ON-LINE ALGORITHMS; PAGERANK; QUERY NODES; QUERY TIME; RANDOM WALK; REAL-WORLD GRAPHS; RUNNING TIME; SIMILARITY MEASURE; SMALL SIZE;

DISKS (STRUCTURAL COMPONENTS); FORECASTING; GRAPHIC METHODS;

CLUSTERING ALGORITHMS;

EID: 77956202102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835871     Document Type: Conference Paper

References (26)

1. D. Aldous and J. A. Fill. Reversible Markov Chains. 2001.
2. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, 2006.
3. A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In VLDB, 2004.
4. P. Berkhin. Bookmark-Coloring Algorithm for Personalized PageRank Computing. Internet Mathematics, 2006.
5. M. Brand. A Random Walks Perspective on Maximizing Satisfaction and Profit. In SIAM '05, 2005.
6. S. Chakrabarti. Dynamic personalized pagerank in entity-relation graphs. In WWW '07, New York, NY, USA.
7. S. Chakrabarti, J. Mirchandani, and A. Nandi. Spin: searching personal information networks. In SIGIR '05.
8. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan. On compressing social networks. In KDD '09.
9. B. B. Dalvi, M. Kshirsagar, and S. Sudarshan. Keyword search on external memory data graphs. Proceedings of VLDB Endowment, 1(1):1189-1204, 2008.
10. D. Fogaras, B. Rcz, K. Csalogány, and T. Sarlós. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics, 2004.
11. F. C. Graham and W. Zhao. Pagerank and random walks on graphs. In "Fete of Combinatorics".
12. Z. Gyongyi, H. Garcia-Molina, and J. Pedersen. Combating web spam with trustrank. In VLDB, pages 576-587, 2004.
13. J. Hopcroft and D. Sheldon. Manipulation-resistant reputations using hitting time. Technical report, Cornell University, 2007.
14. G. Jeh and J. Widom. Scaling personalized web search. In Stanford University Technical Report, 2002.
15. G. Jeh and J. Widom. Simrank: A measure if structural-context similarity. In ACM SIGKDD, 2002.
16. A. Joshi, R. Kumar, B. Reed, and A. Tomkins. Anchor-based proximity measures. In WWW '07.
17. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998.
18. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03, 2003.
19. Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In CIKM '08.
20. H. Qiu and E. R. Hancock. Image segmentation using commute times. In Proc. BMVC, 2005.
21. H. Qiu and E. R. Hancock. Robust multi-body motion tracking using commute time clustering. In ECCV'06, 2006.
22. P. Sarkar and A. Moore. Fast nearest-neighbor search in disk-resident graphs. Technical report:10-005, Machine Learning Department, Carnegie Mellon University, 2010.
23. T. Sarlós, A. A. Benczúr, K. Csalogány, D. Fogaras, and B. Rácz. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In WWW, 2006.
24. A. D. Sarma, S. Gollapudi, and R. Panigrahy. Estimating pagerank on graph streams. In PODS, 2008.
25. D. Spielman and S. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the STOC'04.
26. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, volume 20, 2003.