{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:10:18Z","timestamp":1761581418372},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T00:00:00Z","timestamp":1461715200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10115-016-0949-5","type":"journal-article","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T04:49:32Z","timestamp":1461732572000},"page":"417-446","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["MiMAG: mining coherent subgraphs in multi-layer graphs with edge labels"],"prefix":"10.1007","volume":"50","author":[{"given":"Brigitte","family":"Boden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"G\u00fcnnemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,27]]},"reference":[{"key":"949_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and mining graph data","author":"C Aggarwal","year":"2010","unstructured":"Aggarwal C, Wang H (2010) Managing and mining graph data. Springer, New York"},{"key":"949_CR2","doi-asserted-by":"publisher","unstructured":"Araujo M, G\u00fcnnemann S, Papadimitriou S, Faloutsos C, Basu P, Swami A, Papalexakis EE, Koutra D (2016) Discovery of \u201ccomet\u201d communities in temporal and labeled graphs com $$^{\\wedge 2}$$ \u2227 2 . Knowl Inf Syst 46(3):657\u2013677. doi: 10.1007\/s10115-015-0847-2","DOI":"10.1007\/s10115-015-0847-2"},{"key":"949_CR3","doi-asserted-by":"publisher","unstructured":"Berlingerio M, Coscia M, Giannotti F (2011) Finding and characterizing communities in multidimensional networks. In: ASONAM, pp 490\u2013494. doi: 10.1109\/ASONAM.2011.104","DOI":"10.1109\/ASONAM.2011.104"},{"key":"949_CR4","doi-asserted-by":"crossref","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful? In: ICDT, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"949_CR5","unstructured":"Boden B (2014) Combined clustering of graph and attribute data. PhD thesis, RWTH Aachen University"},{"key":"949_CR6","doi-asserted-by":"crossref","unstructured":"Boden B, G\u00fcnnemann S, Hoffmann H, Seidl T (2012) Mining coherent subgraphs in multi-layer graphs with edge labels. In: SIGKDD","DOI":"10.1145\/2339530.2339726"},{"key":"949_CR7","doi-asserted-by":"crossref","unstructured":"Boden B, G\u00fcnnemann S, Hoffmann H, Seidl T (2013) RMiCS: a robust approach for mining coherent subgraphs in edge-labeled multi-layer graphs. In: SSDBM, p 23","DOI":"10.1145\/2484838.2484860"},{"key":"949_CR8","first-page":"445","volume":"3721","author":"D Cai","year":"2005","unstructured":"Cai D, Shao Z, He X, Yan X, Han J (2005) Community mining from multi-relational networks. PKDD 3721:445\u2013452","journal-title":"Community mining from multi-relational networks. PKDD"},{"key":"949_CR9","first-page":"37","volume":"8","author":"L Cerf","year":"2008","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2008) Data-peeler: constraint-based closed pattern mining in n-ary relations. SDM 8:37\u201348","journal-title":"SDM"},{"issue":"1","key":"949_CR10","first-page":"1","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2009a) Closed patterns meet n-ary relations. TKDD 3(1):1\u20133","journal-title":"Closed patterns meet n-ary relations. TKDD"},{"key":"949_CR11","doi-asserted-by":"crossref","unstructured":"Cerf L, Nguyen TBN, Boulicaut JF (2009b) Discovering relevant cross-graph cliques in dynamic networks. In: ISMIS, pp 513\u2013522","DOI":"10.1007\/978-3-642-04125-9_54"},{"key":"949_CR12","doi-asserted-by":"crossref","unstructured":"Cheng Y, Zhao R (2009) Multiview spectral clustering via ensemble. In: GRC, IEEE, pp 101\u2013106","DOI":"10.1109\/GRC.2009.5255152"},{"issue":"11","key":"949_CR13","doi-asserted-by":"publisher","first-page":"5820","DOI":"10.1109\/TSP.2012.2212886","volume":"60","author":"X Dong","year":"2012","unstructured":"Dong X, Frossard P, Vandergheynst P, Nefedov N (2012) Clustering with multi-layer graphs: a spectral perspective. Signal Process 60(11):5820\u20135831. doi: 10.1109\/TSP.2012.2212886","journal-title":"Signal Process"},{"issue":"3\u20135","key":"949_CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"949_CR15","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2010) Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: ICDM, pp 845\u2013850","DOI":"10.1109\/ICDM.2010.95"},{"key":"949_CR16","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, Boden B, Seidl T (2011) DB-CSC: a density-based approach for subspace clustering in graphs with feature vectors. In: PKDD, pp 565\u2013580","DOI":"10.1007\/978-3-642-23780-5_46"},{"key":"949_CR17","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, F\u00e4rber I, M\u00fcller E, Assent I, Seidl T (2011) External evaluation measures for subspace clustering. In: CIKM","DOI":"10.1145\/2063576.2063774"},{"issue":"2","key":"949_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-012-0272-z","volume":"25","author":"S G\u00fcnnemann","year":"2012","unstructured":"G\u00fcnnemann S, Boden B, Seidl T (2012) Finding density-based subspace clusters in graphs with feature vectors. Data Min Knowl Discov 25(2):243\u2013269","journal-title":"Data Min Knowl Discov"},{"key":"949_CR19","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Raubach S, Seidl T (2013) Spectral subspace clustering for graphs with feature vectors. In: ICDM, pp 231\u2013240","DOI":"10.1109\/ICDM.2013.110"},{"issue":"2","key":"949_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10115-013-0640-z","volume":"40","author":"S G\u00fcnnemann","year":"2014","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2014) Gamer: a synthesis of subspace clustering and dense subgraph mining. Knowl Inf Syst 40(2):243\u2013278","journal-title":"Knowl Inf Syst"},{"key":"949_CR21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1093\/bioinformatics\/18.suppl_1.S145","volume":"18","author":"D Hanisch","year":"2002","unstructured":"Hanisch D, Zien A, Zimmer R, Lengauer T (2002) Co-clustering of biological networks and gene expression data. Bioinformatics 18:145\u2013154","journal-title":"Bioinformatics"},{"issue":"2","key":"949_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02854581","volume":"9","author":"F Harary","year":"1960","unstructured":"Harary F, Norman R (1960) Some properties of line digraphs. Rendiconti del Circolo Matematico di Palermo 9(2):161\u2013168","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"issue":"2","key":"949_CR23","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart P, Nilsson N, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. Syst Sci Cybern 4(2):100\u2013107. doi: 10.1109\/TSSC.1968.300136","journal-title":"Syst Sci Cybern"},{"issue":"1","key":"949_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"HP Kriegel","year":"2009","unstructured":"Kriegel HP, Kr\u00f6ger P, Zimek A (2009) Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. TKDD 3(1):1\u201358. doi: 10.1145\/1497577.1497578","journal-title":"TKDD"},{"issue":"2","key":"949_CR25","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.physa.2004.11.039","volume":"350","author":"M Li","year":"2005","unstructured":"Li M, Fan Y, Chen J, Gao L, Di Z, Wu J (2005) Weighted networks of scientific communication: the measurement and topological role of weight. Physica A: Stat Mech Appl 350(2):643\u2013656","journal-title":"Physica A: Stat Mech Appl"},{"key":"949_CR26","doi-asserted-by":"crossref","unstructured":"Liu G, Wong L (2008) Effective pruning techniques for mining quasi-cliques. In: ECML\/PKDD (2), pp 33\u201349","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"949_CR27","doi-asserted-by":"crossref","unstructured":"Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: SDM, pp 593\u2013604","DOI":"10.1137\/1.9781611972795.51"},{"key":"949_CR28","doi-asserted-by":"crossref","unstructured":"M\u00fcller E, Assent I, G\u00fcnnemann S, Krieger R, Seidl T (2009) Relevant subspace clustering: mining the most interesting non-redundant concepts in high dimensional data. In: ICDM, pp 377\u2013386","DOI":"10.1109\/ICDM.2009.10"},{"key":"949_CR29","doi-asserted-by":"crossref","unstructured":"M\u00fcller E, G\u00fcnnemann S, Assent I, Seidl T (2009) Evaluating clustering in subspace projections of high dimensional data. In: VLDB, pp 1270\u20131281","DOI":"10.14778\/1687627.1687770"},{"key":"949_CR30","doi-asserted-by":"crossref","DOI":"10.21236\/ADA472209","volume-title":"Spectral clustering with links and attributes","author":"J Neville","year":"2004","unstructured":"Neville J, Adler M, Jensen D (2004) Spectral clustering with links and attributes. University of Massachusetts Amherst, Technical Report, Department of Computer Science"},{"key":"949_CR31","volume-title":"Heuristics: intelligent search strategies for computer problem solving","author":"J Pearl","year":"1984","unstructured":"Pearl J (1984) Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley Pub. Co., Inc, Reading"},{"key":"949_CR32","doi-asserted-by":"crossref","unstructured":"Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: SIGKDD, pp 228\u2013238","DOI":"10.1145\/1081870.1081898"},{"key":"949_CR33","doi-asserted-by":"crossref","unstructured":"Qi G, Aggarwal C, Huang T (2012) Community detection with edge content in social media networks. In: ICDE, pp 534\u2013545","DOI":"10.1109\/ICDE.2012.77"},{"key":"949_CR34","unstructured":"Rymon R (1992) Search through systematic set enumeration. In: KR, pp 539\u2013550"},{"key":"949_CR35","unstructured":"Shiga M, Takigawa I, Mamitsuka H (2007) A spectral clustering approach to optimally combining numerical vectors with a modular network. In: SIGKDD, pp 647\u2013656"},{"key":"949_CR36","unstructured":"Spielmat D, Teng S (1996) Spectral partitioning works: planar graphs and finite element meshes. In: FOCS, pp 96\u2013105"},{"key":"949_CR37","doi-asserted-by":"crossref","unstructured":"Spyropoulou E, De Bie T (2011) Interesting multi-relational patterns. In: ICDM, pp 675\u2013684","DOI":"10.1109\/ICDM.2011.82"},{"key":"949_CR38","doi-asserted-by":"crossref","unstructured":"Tang L, Wang X, Liu H (2009a) Uncovering groups via heterogeneous interaction analysis. In: ICDM, pp 503\u2013512","DOI":"10.1109\/ICDM.2009.20"},{"key":"949_CR39","doi-asserted-by":"crossref","unstructured":"Tang W, Lu Z, Dhillon IS (2009b) Clustering with multiple graphs. In: Ninth IEEE international conference on data mining, ICDM\u201909, pp 1016\u20131021","DOI":"10.1109\/ICDM.2009.125"},{"issue":"1","key":"949_CR40","first-page":"1","volume":"25","author":"L Tang","year":"2012","unstructured":"Tang L, Wang X, Liu H (2012) Community detection via heterogeneous interaction analysis. DMKD 25(1):1\u201333","journal-title":"DMKD"},{"key":"949_CR41","doi-asserted-by":"publisher","unstructured":"Wang J, Zeng Z, Zhou L (2006) Clan: an algorithm for mining closed cliques from large dense graph databases. In: ICDE, p 73. doi: 10.1109\/ICDE.2006.34","DOI":"10.1109\/ICDE.2006.34"},{"key":"949_CR42","doi-asserted-by":"crossref","unstructured":"Wu Z, Yin W, Cao J, Xu G, Cuzzocrea A (2013) Community detection in multi-relational social networks. In: Web Information Systems Engineering-WISE 2013. Springer, pp 43\u201356","DOI":"10.1007\/978-3-642-41154-0_4"},{"key":"949_CR43","doi-asserted-by":"crossref","unstructured":"Zeng Z, Wang J, Zhou L, Karypis G (2006) Coherent closed quasi-clique discovery from large dense graph databases. In: SIGKDD, pp 797\u2013802","DOI":"10.1145\/1150402.1150506"},{"key":"949_CR44","doi-asserted-by":"crossref","unstructured":"Zhou W, Jin H, Liu Y (2012) Community discovery and profiling with social messages. In: SIGKDD, pp 388\u2013396","DOI":"10.1145\/2339530.2339593"},{"issue":"1","key":"949_CR45","first-page":"718","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural\/attribute similarities. PVLDB 2(1):718\u2013729","journal-title":"PVLDB"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0949-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-0949-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0949-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0949-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T02:01:36Z","timestamp":1567821696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-0949-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,27]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["949"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-0949-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,27]]}}}