Fast and unified local search for random walk based k-nearest-neighbor query in large graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2014, Pages 1139-1150

  Wu, Yubao ^a   Jin, Ruoming ^b   Zhang, Xiang ^a  

^a Case Western Reserve University   (United States)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Local search; Nearest neighbors; Proximity search; Random walk; Top k search

Indexed keywords

RANDOM PROCESSES;

LOCAL SEARCH; NEAREST NEIGHBORS; PROXIMITY SEARCH; RANDOM WALK; TOP-K SEARCH;

OPTIMIZATION;

EID: 84904279464     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2588555.2610500     Document Type: Conference Paper

References (22)

1. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs, 2002.
2. P. Berkhin. Bookmark-coloring algorithm for personalized PageRank computing. Internet Mathematics, 3(1):41-62, 2006.
3. P. Bogdanov and A. Singh. Accurate and scalable nearest neighbors in large networks based on effective importance. In CIKM, pages 523-528, 2013.
4. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In SDM, pages 442-446, 2004.
5. S. Chakrabarti, A. Pathak, and M. Gupta. Index design and query processing for graph conductance search. VLDB, 20(3):445-470, 2011.
6. S. Cohen, B. Kimelfeld, and G. Koutrika. A survey on proximity measures for social networks. In Search Computing, pages 191-206, 2012.
7. P. Erdo″s and A. Rényi. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl, 5:17-61, 1960.
8. Y. Fujiwara, M. Nakatsuji, M. Onizuka, and M. Kitsuregawa. Fast and exact top-k search for random walk with restart. VLDB, 5(5):442-453, 2012.
9. Y. Fujiwara, M. Nakatsuji, H. Shiokawa, T. Mishima, and M. Onizuka. Efficient ad-hoc search for personalized PageRank. In SIGMOD, pages 445-456, 2013.
10. Y. Fujiwara, M. Nakatsuji, T. Yamamuro, H. Shiokawa, and M. Onizuka. Efficient personalized PageRank with accuracy assurance. In KDD, pages 15-23, 2012.
11. Z. Guan, J. Wu, Q. Zhang, A. Singh, and X. Yan. Assessing and ranking structural correlations in graphs. In SIGMOD, pages 937-948, 2011.
12. E. A. Guillemin. Introductory circuit theory. John Wiley & Sons, 1953.
13. P. Lee, L. V. Lakshmanan, and J. X. Yu. On top-k structural similarity search. In ICDE, pages 774-785, 2012.
14. Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In CIKM, pages 469-478, 2008.
15. C. Meyer. Matrix analysis and applied linear algebra. SIAM, 2000.
16. Y. Saad. Iterative methods for sparse linear systems. SIAM, 2003.
17. P. Sarkar and A. W. Moore. A tractable approach to funding closet truncated communicate time nieghbors in large graphs. In UAI, pages 335-343, 2007.
18. P. Sarkar and A. W. Moore. Fast nearest-neighbor search in disk-resident graphs. In KDD, pages 513-522, 2010.
19. P. Sarkar, A. W. Moore, and A. Prakash. Fast incremental proximity search in large graphs. In ICML, pages 896-903, 2008.
20. H. Tong, C. Faloutsos, and J.-Y. Pan. Fast random walk with restart and its applications. In ICDM, pages 613-622, 2006.
21. C. Zhang, L. Shou, K. Chen, G. Chen, and Y. Bei. Evaluating geo-social inuence in location-based social networks. In CIKM, pages 1442-1451, 2012.
22. X. Zhao, A. Chang, A. D. Sarma, H. Zheng, and B. Y. Zhao. On the embeddability of random walk distances. VLDB, 6(14), 2013.