Mining connection pathways for marked nodes in large graphs

Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013

Volumn , Issue , 2013, Pages 37-45

  Akoglu, Leman ^a   Vreeken, Jilles ^b   Tong, Hanghang ^c   Chau, Duen Horng ^d   Tatti, Nikolaj ^e   Faloutsos, Christos ^f  

^a STONY BROOK UNIVERSITY   (United States)

^b UNIVERSITY OF ANTWERP   (Belgium)

^c CITY UNIVERSITY OF NEW YORK   (United States)

^d GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^e UNIVERSITY OF LEUVEN   (Belgium)

^f CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; ALGORITHMS; PROBLEM SOLVING;

EXTERNAL PROCESS; LARGE GRAPHS; MINIMUM DESCRIPTION LENGTH PRINCIPLE; SIMPLE CONNECTIONS; NP-HARD;

GRAPH THEORY;

EID: 84960112617     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972832.5     Document Type: Conference Paper

References (32)

1. L. Akoglu, J. Vreeken, H. Tong, D. H. Chau, N. Tatti, and C. Faloutsos. Islands and bridges: Making sense of marked nodes in large graphs. (CMU-CS-12-124), August 2012.
2. R. Andersen, F. R. K. Chung, and K. J. Lang. Local graph partitioning using pagerank vectors. In FOCS, 2006.
3. R. Andersen and K. J. Lang. Communities from seed sets. In WWW, pages 223-232, 2006.
4. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using banks. In ICDE, pages 431-440, 2002.
5. M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. In SODA, pages 192-200, 1998.
6. D. H. Chau, C. Faloutsos, H. Tong, J. I. Hong, B. Gallagher, and T. Eliassi-Rad. Graphite: A visual query system for large graphs. In ICDM Workshops, pages 963-966, 2008.
7. Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400, 1965.
8. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD, 2004.
9. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In KDD, 2000.
10. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99(12), 2002.
11. P. Grünwald. The Minimum Description Length Principle. MIT Press, 2007.
12. C. S. Helvig, G. Robins, and A. Zelikovsky. An improved approximation scheme for the group steiner problem. Networks, 37(1):8-20, 2001.
13. W. Jin, R. K. Srihari, and X.Wu. Mining concept associations for knowledge discovery through concept chain queries. In PAKDD, pages 555-562, 2007.
14. J. F. R. Jr., H. Tong, A. J. M. Traina, C. Faloutsos, and J. Leskovec. Gmine: A system for scalable, interactive graph visualization and mining. In VLDB, pages 1195-1198, 2006.
15. G. Karypis and V. Kumar. Multilevel algorithms for multiconstraint graph partitioning. In Supercomputing, 1998.
16. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD, 2006.
17. J. Leskovec, S. Dumais, and E. Horvitz. Web projections: learning from contextual subgraphs of the web. In WWW, pages 471-480, 2007.
18. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer, 1993.
19. A. Liekens, J. De Knijf, W. Daelemans, B. Goethals, P. De Rijk, and J. Del Favero. BioGraph: unsupervised biomedical knowledge discovery via automated hypothesis generation. Genome Biol., 12(6), 2011.
20. V. Melkonian. New primal-dual algorithms for steiner tree problems. Comp. Oper. Res., 34:2147-2167, 2007.
21. C. Ramakrishnan, W. H. Milnor, M. Perry, and A. P. Sheth. Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explor., 7(2):56-63, 2005.
22. J. Riedy, D. A. Bader, K. Jiang, P. Pande, , and R. Sharma. Detecting communities from given seeds in social networks. Technical Report GT-CSE-11-01, 2011.
23. J. Rissanen. Modeling by shortest data description. Automatica, 14(1):465-471, 1978.
24. P. Sevon and L. Eronen. Subgraph queries by context-free grammars. J. Integr. Bioinf., 5(2), 2008.
25. D. Shahaf and C. Guestrin. Connecting the dots between news articles. In KDD, pages 623-632, 2010.
26. W. Shrum, N. H. Cheek, and S. M. Hunter. Friendship in school: Gender and racial homophily. Soc. Edu., 61:227-239, 1988.
27. D. A. Spielman and S.-H. Teng. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR, abs/0809.3232, 2008.
28. H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. In KDD, pages 404-413, 2006.
29. H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In KDD, pages 747-756, 2007.
30. H. Tong, S. Papadimitriou, C. Faloutsos, P. S. Yu, and T. Eliassi-Rad. Basset: Scalable gateway finder in large graphs. In PAKDD, pages 449-463, 2010.
31. W. Zachary. An information flow model for conflict and fission in small groups. J. Anthr. Res., 33:452-473, 1977.
32. A. Zelikovsky. A series of approximation algorithms for the acyclic directed steiner tree problem. Algorithmica, 18(1):99-110, 1997.