{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:09:53Z","timestamp":1761394193144,"version":"3.40.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,6,3]],"date-time":"2012-06-03T00:00:00Z","timestamp":1338681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10618-012-0272-z","type":"journal-article","created":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T00:21:51Z","timestamp":1338596511000},"page":"243-269","source":"Crossref","is-referenced-by-count":19,"title":["Finding density-based subspace clusters in graphs with feature vectors"],"prefix":"10.1007","volume":"25","author":[{"given":"Stephan","family":"G\u00fcnnemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Boden","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":[[2012,6,3]]},"reference":[{"key":"272_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":"272_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: SIGMOD, pp 94\u2013105. SIGMOD, Seattle","DOI":"10.1145\/276305.276314"},{"key":"272_CR3","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, M\u00fcller E, Seidl T (2008) EDSC: efficient density-based subspace clustering. In: CIKM, pp 1093\u20131102. CIKM, Glasgow","DOI":"10.1145\/1458082.1458227"},{"key":"272_CR4","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. ICDT, Mont Blanc","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"4","key":"272_CR5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"S Dorogovtsev","year":"2006","unstructured":"Dorogovtsev S, Goltsev A, Mendes J (2006) K-core organization of complex networks. Phys Rev Lett 96(4): 40\u2013601","journal-title":"Phys Rev Lett"},{"key":"272_CR6","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. SNA-KDD, San Jose","DOI":"10.1145\/1348549.1348552"},{"key":"272_CR7","unstructured":"Ester M, Kriegel HP, S J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp 226\u2013231. KDD, Portland"},{"key":"272_CR8","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. SDM, Bethesda","DOI":"10.1137\/1.9781611972764.22"},{"key":"272_CR9","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. CIKM, Hong Kong","DOI":"10.1145\/1645953.1646120"},{"key":"272_CR10","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. ICDM, Sydney","DOI":"10.1109\/ICDM.2010.95"},{"key":"272_CR11","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, Kremer H, Seidl T (2010) Subspace clustering for uncertain data. In: SDM, pp 385\u2013396. SDM, Bethesda","DOI":"10.1137\/1.9781611972801.34"},{"key":"272_CR12","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: ECML\/PKDD (1), pp 565\u2013580. ECML, Athens","DOI":"10.1007\/978-3-642-23780-5_46"},{"key":"272_CR13","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. CIKM, Glasgow","DOI":"10.1145\/2063576.2063774"},{"key":"272_CR14","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":"272_CR15","unstructured":"Hinneburg A, Keim DA (1998) An efficient approach to clustering in large multimedia databases with noise. In: KDD, pp 58\u201365. KDD, New York"},{"issue":"1\u20132","key":"272_CR16","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/rsa.20147","volume":"30","author":"S Janson","year":"2007","unstructured":"Janson S, Luczak M (2007) A simple solution to the k-core problem. Rand Struct Algorithm 30(1\u20132): 50\u201362","journal-title":"Rand Struct Algorithm"},{"key":"272_CR17","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. SDM, Bethesda","DOI":"10.1137\/1.9781611972740.23"},{"issue":"1","key":"272_CR18","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. Trans Knowl Discov Data 3(1): 1\u201358","journal-title":"Trans Knowl Discov Data"},{"key":"272_CR19","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. ICDM, Sydney","DOI":"10.1109\/ICDM.2003.1250980"},{"key":"272_CR20","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. KDD, Portland","DOI":"10.1145\/1150402.1150439"},{"key":"272_CR21","doi-asserted-by":"crossref","unstructured":"Long B, Zhang ZM, Yu PS (2007) A probabilistic framework for relational clustering. In: KDD, pp 470\u2013479. KDD, Portland","DOI":"10.1145\/1281192.1281244"},{"key":"272_CR22","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. KDD, Portland","DOI":"10.1145\/1401890.1401956"},{"key":"272_CR23","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. SDM, Bethesda","DOI":"10.1137\/1.9781611972795.51"},{"key":"272_CR24","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. ICDM, Sydney","DOI":"10.1109\/ICDM.2009.10"},{"key":"272_CR25","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. VLDB, Singapore","DOI":"10.14778\/1687627.1687770"},{"issue":"1","key":"272_CR26","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":"272_CR27","doi-asserted-by":"crossref","unstructured":"Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: KDD, pp 228\u2013238. KDD, Portland","DOI":"10.1145\/1081870.1081898"},{"key":"272_CR28","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. ICDM, Sydney","DOI":"10.1109\/ICDM.2007.72"},{"issue":"1","key":"272_CR29","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1186\/1752-0509-1-8","volume":"1","author":"I Ulitsky","year":"2007","unstructured":"Ulitsky I, Shamir R (2007) Identification of functional modules using network topology and high-throughput data. BMC Syst Biol 1(1): 8","journal-title":"BMC Syst Biol"},{"issue":"1","key":"272_CR30","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"},{"key":"272_CR31","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. ICDM, Sydney","DOI":"10.1109\/ICDM.2010.41"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0272-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-012-0272-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0272-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T06:36:27Z","timestamp":1743230187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-012-0272-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["272"],"URL":"https:\/\/doi.org\/10.1007\/s10618-012-0272-z","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2012,6,3]]}}}