IPoG: Fast interactive proximity querying on graphs

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 1673-1676

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

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

Author keywords

Graph mining; Proximity; Scalability

Indexed keywords

BIPARTITE GRAPHS; COMPUTATIONAL ISSUES; FAST SOLUTIONS; GRAPH MINING; PROXIMITY QUERIES; SEARCH RESULTS;

KNOWLEDGE MANAGEMENT; SCALABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 74549205239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646201     Document Type: Conference Paper

References (16)

1. 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.
2. A. Agarwal, S. Chakrabarti, and S. Aggarwal. Learning to rank networked entities. In KDD, pages 14-23, 2006.
3. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
4. 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.
5. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD, pages 118-127, 2004.
6. F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552-563, 2004.
7. 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.
8. J. He, M. Li, H.-J. Zhang, H. Tong, and C. Zhang. Manifold-ranking based image retrieval. In ACM Multimedia, pages 9-16, 2004.
9. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD, pages 245-255, 2006.
10. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
11. H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. In KDD, pages 404-413, 2006.
12. 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.
13. H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In KDD, pages 747-756, 2007.
14. 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.
15. H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, pages 704-715, 2008.
16. H. Tong, H. Qu, and H. Jamjoom. Measuring proximity on graphs with side information. In ICDM, pages 598-607, 2008.