Measuring proximity on graphs with side information

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 598-607

  Tong, Hanghang ^a   Qu, Huiming ^b   Jamjoom, Hani ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC IDEA; EXPERIMENTAL EVALUATION; FAST ALGORITHMS; GRAPH STRUCTURES; IMAGE CAPTION; LARGE GRAPHS; NEIGHBORHOOD SEARCH; RANDOM WALK; RANDOM WALK WITH RESTART; SIDE INFORMATION; SUBGRAPHS;

COMPUTATIONAL COMPLEXITY; MINING;

INFORMATION MANAGEMENT;

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

References (26)

1. D. Achlioptas and F. McSherry. Fast computation of lowrank matrix approximations. J. ACM, 54(2), 2007.
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. Agarwal, S. Chakrabarti, and S. Aggarwal. Learning to rank networked entities. In KDD, pages 14-23, 2006. (Pubitemid 44535499)
4. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
5. H. Cheng, P.-N. Tan, J. Sticklen, and W. F. Punch. Recommendation via query centered random walk on k-partite graph. In ICDM, pages 457-462, 2007.
6. P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition. SIAM Journal of Computing, 2005.
7. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD, pages 118-127, 2004. (Pubitemid 40114922)
8. F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552-563, 2004.
9. G. H. Golub and C. F. Van-Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 2nd edition, 1989.
10. M. Grötschel, C. L. Monma, and M. Stoer. Design of survivable networks. In Handbooks in Operations Research and Management Science 7: Network Models. North Holland, 1993.
11. R. V. Guha, R. Kumar, P. Raghavan, and A. Tomkins. Propagation of trust and distrust. In WWW, pages 403-412, 2004.
12. T. H. Haveliwala. Topic-sensitive pagerank: A contextsensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng., 15(4):784-796, 2003.
13. J. He, M. Li, H.-J. Zhang, H. Tong, and C. Zhang. Manifoldranking based image retrieval. In ACM Multimedia, pages 9-16, 2004.
14. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In FOCS, pages 189- 197, 2000. (Pubitemid 32075890)
15. K. V. R. Kanth, D. Agrawal, and A. K. Singh. Dimensionality reduction for similarity searching in dynamic databases. In SIGMOD Conference, pages 166-176, 1998. (Pubitemid 128655966)
16. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD, pages 245-255, 2006. (Pubitemid 44535521)
17. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. CIKM, 2003.
18. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004. (Pubitemid 40114986)
19. W. Piegorsch and G. E. Casella. Inverting a sum of matrices. In SIAM Review, volume 32, pages 470-1470, 1990.
20. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418-425, 2005. (Pubitemid 47385721)
21. J. Sun, Y. Xie, H. Zhang, and C. Faloutsos. Less is more: Compact matrix decomposition for large sparse graphs. In SDM, 2007.
22. H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. In KDD, pages 404-413, 2006. (Pubitemid 44535537)
23. H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast best-effort pattern matching in large attributed graphs. In KDD, pages 737-746, 2007. (Pubitemid 350229259)
24. H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In KDD, pages 747-756, 2007. (Pubitemid 350229260)
25. H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: Fast solutions and applications. Knowledge and Information Systems: An International Journal (KAIS), 2008.
26. H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, pages 704-715, 2008.