Fast random walk with restart and its applications

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 613-622

  Tong, Hanghang ^a   Faloutsos, Christos ^a   Pan, Jia Yu ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAPTIONING; GENERALIZATIONS; PRE-COMPUTATION TIME; RANDOM WALK; RELEVANCE SCORE;

APPROXIMATION THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; IMAGE ANALYSIS;

DATA MINING;

EID: 34748827346     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.70     Document Type: Conference Paper

References (29)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximation. In STOC, 2001.
2. B. Aditya, G. Bhalotia, S. Chakrabarti, A. Hulgeri, C. Nakhe, and S. S. Parag. Banks: Browsing and keyword searching in relational databases. In VLDB, pages 1083-1086, 2002.
3. A. Balmin, V. Hristidis, and Y Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
4. http://www.informatik.uni-trier.de/ley/db/.
5. S. Deerwester, S. Dumais, T. Landauer, G. Furnas, and R. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
6. I. S. Dhillon, S. Mallela, and D. S. Modha. Informationtheoretic co-clustering. In The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 03), Washington, DC, August 24-27 2003.
7. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD, pages 118-127, 2004.
8. G. Flake, S. Lawrence, and C. Giles. Efficient identification
9. of web communities. In KDD, pages 150-160, 2000.
10. D. Fogaras and B. Racz. Towards scaling fully personalized pagerank. In Proc. WAW, pages 105-117, 2004.
11. F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552-563, 2004.
12. M. Girvan and M. E. J. Newman. Community structure is social and biological networks.
13. G. Golub and C. Loan. Matrix Computation. Johns Hopkins, 1996.
14. T. H. Haveliwala. Topic-sensitive pagerank. WWW, pages 517-526, 2002.
15. J. He, M. Li, H. Zhang, H. Tong, and C. Zhang. Manifoldranking based image retrieval. In ACM Multimedia, pages 9-16, 2004.
16. G. Jeh and J. Widom. Simrank: A measure of structuralcontext similarity. In KDD, pages 538-543, 2002.
17. G. Jeh and J. Widom. Scaling personalized web search. In WWW, 2003.
18. I. Jolliffe. Principal Component Analysis. Springer, 2002.
19. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing pagerank. In Stanford University Technical Report, 2003.
20. G. Karypis and V. Kumar. Parallel multilevel k-way partitioning for irregular graphs. SIAM Review, 41(2):278-300, 1999.
21. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. InNIPS, pages 849-856, 2001.
22. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998. Paper SIDL-WP-1999-0120 (version of 11/11/1999).
23. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
24. W. Piegorsch and G. E. Casella. Inverting a sum of matrices. In SIAM Review, 1990.
25. C. E. Rasmusen and C. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006.
26. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418-425, 2005.
27. H. Tong and C. Faloutsos. Center-piece subgraphs: Problem definition and fast solutions. In KDD, 2006.
28. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Scholkopf. Learning with local and global consistency. InMPS, 2003.
29. X. Zhu, Z. Ghahramani, and J. D. Lafferty. Semi-supervised learning using gaussian field and harmonic functions. In ICML, pages 912-919, 2003.