Fast and exact top-k search for random walk with restart

Proceedings of the VLDB Endowment

Volumn 5, Issue 5, 2012, Pages 442-453

  Fujiwara, Yasuhiro ^a,b   Nakatsuji, Makoto ^a   Onizuka, Makoto ^a   Kitsuregawa, Masaru ^b  

^a NTT CORPORATION   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC IMAGE CAPTIONING; LINK PREDICTION; RANDOM WALK WITH RESTART; REAL-WORLD SYSTEM; SEARCH TIME; SPARSE MATRICES;

RANDOM PROCESSES;

EID: 84863768837     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2140436.2140441     Document Type: Article

References (25)

1. +: Query Rewriting through Link Analysis of the Click Graph. PVLDB, 1(1):408-421, 2008.
2. K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol. Quick Detection of Top-k Personalized PageRank Lists. In WAW, pages 50-61, 2011.
3. V. D. Blondel, J.-L. G uillaume, R. Lambiotte, and E. Lefebvre. Fast Unfolding of Communities in Large Networks. J. Statistical Mechanics: Theory and Experiment, 2008(10), 2008.
4. E. P. F. Chan and H. Lim. Optimization and Evaluation of Shortest Path Queries. VLDB J., 16(3):343-369, 2007.
5. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast Graph Pattern Matching. In ICDE, pages 913-922, 2008.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2009.
7. M. S. Gupta, A. Pathak, and S. Chakrabarti. Fast Algorithms for Top-k Personalized PageRank Queries. In WWW, pages 1225-1226, 2008.
8. J. He, M. Li, H. Zhang, H. Tong, and C. Zhang. Manifold-Ranking Based Image Retrieval. In ACM Multimedia, pages 9-16, 2004.
9. G. Karypis, V. Kumar, and V. Kumar. Multilevel k-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing, 48:96-129, 1998.
10. A. Khan, N. Li, X. Yan, Z. Guan, S. Chakraborty, and S. Tao. Neighborhood Based Fast Graph Search in Large Networks. In SIGMOD Conference, pages 901-912, 2011.
11. I. Konstas, V. Stathopoulos, and J. M. Jose. On Social Networks and Collaborative Recommendation. In SIGIR, pages 195-202, 2009.
12. D. Liben-Nowell and J. M. Kleinberg. The Link Prediction Problem for Social Networks. In CIKM, pages 556-559, 2003.
13. D. Lizorkin, P. Velikhov, M. N. Grinev, and D. Turdakov. Accuracy Estimate and Optimization Techniques for SimRank computation. PVLDB, 1(1):422-433, 2008.
14. M. Newman, A.-L. Barabasi, and D. J. Watts. The Structure And Dynamics of Networks. Princeton University Press, 2006.
15. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic Multimedia Cross-modal Correlation Discovery. In KDD, pages 653-658, 2004.
16. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes 3rd Edition. Cambridge University Press, 2007.
17. R. Schifanella, A. Barrat, C. Cattuto, B. Markines, and F. Menczer. Folks in Folksonomies: Social Link Prediction from Shared Metadata. In WSDM, pages 271-280, 2010.
18. G. Strang. Introduction to Linear Algebra. Wellesley Cambridge Press, 2009.
19. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood Formation and Anomaly Detection in Bipartite Graphs. In ICDM, pages 418-425, 2005.
20. Y. Sun, J. Han, X. Yan, P. Yu, and T. Wu. PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks. PVLDB, 4(1), 2011.
21. H. Tong and C. Faloutsos. Center-Piece Subgraphs: Problem Definition and Fast Solutions. In KDD, pages 404-413, 2006.
22. H. Tong, C. Faloutsos, and J.-Y. Pan. Fast Random Walk with Restart and Its Applications. In ICDM, pages 613-622, 2006.
23. M. Yannakakis. Computing the Minimum Fill-In is NP-Complete. SIAM. J. on Algebraic and Discrete Methods, 2(1):77-79, 1981.
24. + Delta >= Graph. In VLDB, pages 938-949, 2007.
25. Y. Zhou, H. Cheng, and J. X. Yu. Graph Clustering Based on Structural/Attribute Similarities. PVLDB, 2(1):718-729, 2009.