Mining coherent subgraphs in multi-layer graphs with edge labels

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1258-1266

  Boden, Brigitte ^a   Günnemann, Stephan ^a   Hoffmann, Holger ^a   Seidl, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

dense subgraphs; graph clustering; networks

Indexed keywords

BEST FIRST SEARCH; EDGE LABELS; GRAPH CLUSTERING; GRAPH MINING; REAL-WORLD DATASETS; SUBGRAPHS;

DATA MINING; NETWORKS (CIRCUITS);

GRAPH THEORY;

EID: 84866027591     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339726     Document Type: Conference Paper

References (21)

1. C. Aggarwal and H. Wang. Managing and Mining Graph Data. Springer, New York, 2010.
2. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In ICDT, pages 217-235, 1999.
3. L. Cerf, T. B. N. Nguyen, and J.-F. Boulicaut. Discovering relevant cross-graph cliques in dynamic networks. In ISMIS, pages 513-522, 2009.
4. S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75-174, 2010.
5. S. Günnemann, I. Färber, E. Müller, I. Assent, and T. Seidl. External evaluation measures for subspace clustering. In CIKM, pages 1363-1372, 2011.
6. S. Günnemann, B. Boden, and T. Seidl. DB-CSC: A density-based approach for subspace clustering in graphs with feature vectors. In ECML/PKDD (1), pages 565-580, 2011.
7. S. Günnemann, I. Färber, B. Boden, and T. Seidl. Subspace clustering meets dense subgraph mining: A synthesis of two paradigms. In ICDM, pages 845-850, 2010.
8. F. Harary and R. Norman. Some properties of line digraphs. Rendiconti del Circolo Matematico di Palermo, 9(2):161-168, 1960.
9. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, 4(2):100-107, 1968.
10. H.-P. Kriegel, P. Kröger, and A. Zimek. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. TKDD, 3(1):1-58, 2009.
11. M. Li, Y. Fan, J. Chen, L. Gao, Z. Di, and J. Wu. Weighted networks of scientific communication: the measurement and topological role of weight. Physica A: Statistical Mechanics and its Applications, 350(2):643-656, 2005.
12. G. Liu and L. Wong. Effective pruning techniques for mining quasi-cliques. In ECML/PKDD (2), pages 33-49, 2008.
13. E. Müller, I. Assent, S. Günnemann, R. Krieger, and T. Seidl. Relevant subspace clustering: Mining the most interesting non-redundant concepts in high dimensional data. In ICDM, pages 377-386, 2009.
14. F. Moser, R. Colak, A. Rafiey, and M. Ester. Mining cohesive patterns from graphs with feature vectors. In SDM, pages 593-604, 2009.
15. E. Müller, S. Günnemann, I. Assent, and T. Seidl. Evaluating clustering in subspace projections of high dimensional data. In VLDB, pages 1270-1281, 2009.
16. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison Wesley, 1984.
17. J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. In SIGKDD, pages 228-238, 2005.
18. R. Rymon. Search through systematic set enumeration. In KR, pages 539-550, 1992.
19. M. Shiga, I. Takigawa, and H. Mamitsuka. A spectral clustering approach to optimally combining numerical vectors with a modular network. In SIGKDD, pages 647-656, 2007.
20. J. Wang, Z. Zeng, and L. Zhou. Clan: An algorithm for mining closed cliques from large dense graph databases. In ICDE, page 73, 2006.
21. Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Coherent closed quasi-clique discovery from large dense graph databases. In SIGKDD, pages 797-802, 2006.