{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:19:57Z","timestamp":1778606397981,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T00:00:00Z","timestamp":1367971200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10115-013-0640-z","type":"journal-article","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T06:19:45Z","timestamp":1367907585000},"page":"243-278","source":"Crossref","is-referenced-by-count":18,"title":["GAMer: a synthesis of subspace clustering and dense subgraph mining"],"prefix":"10.1007","volume":"40","author":[{"given":"Stephan","family":"G\u00fcnnemann","sequence":"first","affiliation":[]},{"given":"Ines","family":"F\u00e4rber","sequence":"additional","affiliation":[]},{"given":"Brigitte","family":"Boden","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,8]]},"reference":[{"key":"640_CR1","doi-asserted-by":"crossref","unstructured":"Abello J, Resende M, Sudarsky S et al. (2002) Massive quasi-clique detection. Lecture Notes in Computer Science pp. 598\u2013612","DOI":"10.1007\/3-540-45995-2_51"},{"key":"640_CR2","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":"640_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Wolf J, Yu P, Procopiuc C, Park J (1999) Fast algorithms for projected clustering. In: SIGMOD, pp 61\u201372","DOI":"10.1145\/304182.304188"},{"key":"640_CR4","doi-asserted-by":"crossref","unstructured":"Al Hasan M, Chaoji V, Salem S, Besson J, Zaki M (2007) Origami: mining representative orthogonal graph patterns. In: ICDM, pp 153\u2013162","DOI":"10.1109\/ICDM.2007.45"},{"key":"640_CR5","doi-asserted-by":"crossref","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201dnearest neighbor\u201d meaningful?. In: ICDT, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"2","key":"640_CR6","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2","volume":"18","author":"A Condon","year":"2001","unstructured":"Condon A, Karp RM (2001) Algorithms for graph partitioning on the planted partition model. Random Struct Algorithms 18(2):116\u2013140","journal-title":"Random Struct Algorithms"},{"key":"640_CR7","doi-asserted-by":"crossref","unstructured":"Ding CHQ, He X, Zha H, Gu M, Simon HD (2001) A min-max cut algorithm for graph partitioning and data clustering. In: ICDM, pp 107\u2013114","DOI":"10.1109\/ICDM.2001.989507"},{"key":"640_CR8","doi-asserted-by":"crossref","unstructured":"Du N, Wu B, Pei X, Wang B, Xu L (2007) Community detection in large-scale social networks. In: WebKDD\/SNA-KDD, pp 16\u201325","DOI":"10.1145\/1348549.1348552"},{"key":"640_CR9","doi-asserted-by":"crossref","unstructured":"Ester M, Ge R, Gao BJ, Hu Z, Ben-Moshe B (2006) Joint cluster analysis of attribute data and relationship data: the connected k-center problem. In: SDM","DOI":"10.1137\/1.9781611972764.22"},{"key":"640_CR10","volume-title":"Computers and intractability: a guide to NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to NP-completeness. W.H Freeman and Company, San Francisco"},{"key":"640_CR11","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":"640_CR12","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, pp 1363\u20131372","DOI":"10.1145\/2063576.2063774"},{"key":"640_CR13","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, Kremer H, Seidl T (2010) Subspace clustering for uncertain data. In: SDM, pp 385\u2013396","DOI":"10.1137\/1.9781611972801.34"},{"key":"640_CR14","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, M\u00fcller E, F\u00e4rber I, Seidl T (2009) Detection of orthogonal concepts in subspaces of high dimensional data. In: CIKM, pp 1317\u20131326","DOI":"10.1145\/1645953.1646120"},{"key":"640_CR15","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2006","unstructured":"Han J, Kamber M (2006) Data mining: concepts and techniques. Morgan Kaufmann, San Francisco"},{"key":"640_CR16","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"},{"key":"640_CR17","volume-title":"Principal component analysis","author":"I Jolliffe","year":"2002","unstructured":"Jolliffe I (2002) Principal component analysis, 2nd edn. Springer, New York","edition":"2"},{"key":"640_CR18","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel HP, Kroeger P (2004) Density-connected subspace clustering for high-dimensional data. In: SDM, pp 246\u2013257","DOI":"10.1137\/1.9781611972740.23"},{"issue":"1","key":"640_CR19","doi-asserted-by":"crossref","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","journal-title":"TKDD"},{"key":"640_CR20","doi-asserted-by":"crossref","unstructured":"Kubica J, Moore AW, Schneider JG (2003) Tractable group detection on large link data sets. In: ICDM, pp 573\u2013576","DOI":"10.1109\/ICDM.2003.1250980"},{"key":"640_CR21","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":"640_CR22","doi-asserted-by":"crossref","unstructured":"Long B, Wu X, Zhang ZM, Yu PS (2006) Unsupervised learning on k-partite graphs. In: KDD, pp 317\u2013326","DOI":"10.1145\/1150402.1150439"},{"key":"640_CR23","doi-asserted-by":"crossref","unstructured":"Long B, Zhang ZM, Yu PS (2007) A probabilistic framework for relational clustering. In: KDD, pp 470\u2013479","DOI":"10.1145\/1281192.1281244"},{"key":"640_CR24","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J (2008) Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In: KDD, pp 533\u2013541","DOI":"10.1145\/1401890.1401956"},{"key":"640_CR25","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J, Ester M (2006) P3C: a robust projected clustering algorithm. In: ICDM, pp 414\u2013425","DOI":"10.1109\/ICDM.2006.123"},{"key":"640_CR26","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":"640_CR27","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":"640_CR28","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":"640_CR29","doi-asserted-by":"crossref","unstructured":"Neville J, Adler M, Jensen D (2004) Spectral clustering with links and attributes. Dept of Computer Science, University of Massachusetts Amherst, Tech. rep","DOI":"10.21236\/ADA472209"},{"issue":"1","key":"640_CR30","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. SIGKDD Explor 6(1):90\u2013105","journal-title":"SIGKDD Explor"},{"key":"640_CR31","doi-asserted-by":"crossref","unstructured":"Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: KDD, pp 228\u2013238","DOI":"10.1145\/1081870.1081898"},{"key":"640_CR32","doi-asserted-by":"crossref","unstructured":"Procopiuc CM, Jones M, Agarwal PK, Murali TM (2002) A monte carlo algorithm for fast projective clustering. In: SIGMOD, pp 418\u2013427","DOI":"10.1145\/564691.564739"},{"key":"640_CR33","doi-asserted-by":"crossref","unstructured":"Ruan J, Zhang W (2007) An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: ICDM, pp 643\u2013648","DOI":"10.1109\/ICDM.2007.72"},{"key":"640_CR34","unstructured":"Rymon R (1992) Search through systematic set enumeration. In: K.R., pp 539\u2013550"},{"key":"640_CR35","doi-asserted-by":"crossref","unstructured":"Sequeira K, Zaki MJ (2004) Schism: a new approach for interesting subspace mining. In: ICDM, pp 186\u2013193","DOI":"10.1109\/ICDM.2004.10099"},{"key":"640_CR36","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":"640_CR37","doi-asserted-by":"crossref","unstructured":"Shyamsundar R, et al. (2005) A DNA microarray survey of gene expression in normal human tissues. Genome Biol 6(3):R22","DOI":"10.1186\/gb-2005-6-3-r22"},{"key":"640_CR38","doi-asserted-by":"crossref","unstructured":"Silva A, Meira W Jr, Zaki M (2010) Structural correlation pattern mining for large graphs. In: Workshop on mining and learning with graphs, pp 119\u2013126","DOI":"10.1145\/1830252.1830268"},{"key":"640_CR39","doi-asserted-by":"crossref","unstructured":"Stark C, et al. (2006) BioGRID: a general repository for interaction datasets. Nucleic Acids Res 34(suppl 1):D535\u2013D539","DOI":"10.1093\/nar\/gkj109"},{"key":"640_CR40","doi-asserted-by":"crossref","unstructured":"Ulitsky I, Shamir R (2007) Identification of functional modules using network topology and high-throughput data. BMC Syst Biol 1(1):8","DOI":"10.1186\/1752-0509-1-8"},{"key":"640_CR41","unstructured":"Wang J, Zeng Z, Zhou L (2006) Clan: an algorithm for mining closed cliques from large dense graph databases. In: ICDE, p 73"},{"key":"640_CR42","unstructured":"Yiu ML, Mamoulis N (2003) Frequent-pattern based iterative projected clustering. In: ICDM, pp 689\u2013692"},{"issue":"2","key":"640_CR43","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TKDE.2005.29","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu ML, Mamoulis N (2005) Iterative projected clustering by subspace mining. IEEE Trans Knowl Data Eng (TKDE) 17(2):176\u2013189","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"640_CR44","doi-asserted-by":"crossref","unstructured":"Zeeberg B, et al (2003) GoMiner: a resource for biological interpretation of genomic and proteomic data. Genome Biol 4(4):R28","DOI":"10.1186\/gb-2003-4-4-r28"},{"key":"640_CR45","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: KDD, pp 797\u2013802","DOI":"10.1145\/1150402.1150506"},{"key":"640_CR46","doi-asserted-by":"crossref","unstructured":"Zeng Z, Wang J, Zhou L, Karypis G (2007) Out-of-core coherent closed quasi-clique mining from large dense graph databases. TODS 32(2):13","DOI":"10.1145\/1242524.1242530"},{"key":"640_CR47","doi-asserted-by":"crossref","unstructured":"Zhang S, Yang J, Li S (2009) RING: an integrated method for frequent representative subgraph mining. In: ICDM, pp 1082\u20131087","DOI":"10.1109\/ICDM.2009.96"},{"key":"640_CR48","doi-asserted-by":"crossref","unstructured":"Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural\/attribute similarities. In: VLDB, pp 718\u2013729","DOI":"10.14778\/1687627.1687709"},{"key":"640_CR49","doi-asserted-by":"crossref","unstructured":"Zhou Y, Cheng H, Yu JX (2010) Clustering large attributed graphs: an efficient incremental approach. In: ICDM, pp 689\u2013698","DOI":"10.1109\/ICDM.2010.41"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0640-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0640-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0640-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T09:20:02Z","timestamp":1563009602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0640-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,8]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["640"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0640-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,8]]}}}