{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:30:33Z","timestamp":1769441433711,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237799","type":"print"},{"value":"9783642237805","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23780-5_46","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T17:54:37Z","timestamp":1313603677000},"page":"565-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["DB-CSC: A Density-Based Approach for Subspace Clustering in Graphs with Feature Vectors"],"prefix":"10.1007","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","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","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.: Managing and Mining Graph Data. Springer, New York (2010)"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: SIGMOD, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Assent, I., Krieger, R., M\u00fcller, E., Seidl, T.: EDSC: Efficient density-based subspace clustering. In: CIKM, pp. 1093\u20131102 (2008)","DOI":"10.1145\/1458082.1458227"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201dnearest neighbor\u201d meaningful? In: ICDT, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"4","key":"46_CR5","doi-asserted-by":"publisher","first-page":"40601","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"S. Dorogovtsev","year":"2006","unstructured":"Dorogovtsev, S., Goltsev, A., Mendes, J.: K-core organization of complex networks. Physical Review Letters\u00a096(4), 40601 (2006)","journal-title":"Physical Review Letters"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Du, N., Wu, B., Pei, X., Wang, B., Xu, L.: Community detection in large-scale social networks. In: WebKDD\/SNA-KDD, pp. 16\u201325 (2007)","DOI":"10.1145\/1348549.1348552"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Ester, M., Ge, R., Gao, B.J., Hu, Z., Ben-Moshe, B.: Joint cluster analysis of attribute data and relationship data: the connected k-center problem. In: SDM (2006)","DOI":"10.1137\/1.9781611972764.22"},{"key":"46_CR8","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226\u2013231 (1996)"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., F\u00e4rber, I., Boden, B., Seidl, T.: Subspace clustering meets dense subgraph mining: A synthesis of two paradigms. In: ICDM, pp. 845\u2013850 (2010)","DOI":"10.1109\/ICDM.2010.95"},{"key":"46_CR10","doi-asserted-by":"publisher","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.: Co-clustering of biological networks and gene expression data. Bioinformatics\u00a018, 145\u2013154 (2002)","journal-title":"Bioinformatics"},{"key":"46_CR11","unstructured":"Hinneburg, A., Keim, D.A.: An efficient approach to clustering in large multimedia databases with noise. In: KDD, pp. 58\u201365 (1998)"},{"issue":"1-2","key":"46_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/rsa.20147","volume":"30","author":"S. Janson","year":"2007","unstructured":"Janson, S., Luczak, M.: A simple solution to the k-core problem. Random Structures & Algorithms\u00a030(1-2), 50\u201362 (2007)","journal-title":"Random Structures & Algorithms"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H.P., Kroeger, P.: Density-connected subspace clustering for high-dimensional data. In: SDM, pp. 246\u2013257 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"issue":"1","key":"46_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H.P. Kriegel","year":"2009","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Zimek, A.: Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. TKDD\u00a03(1), 1\u201358 (2009)","journal-title":"TKDD"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Kubica, J., Moore, A.W., Schneider, J.G.: Tractable group detection on large link data sets. In: ICDM, pp. 573\u2013576 (2003)","DOI":"10.1109\/ICDM.2003.1250980"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Moser, F., Colak, R., Rafiey, A., Ester, M.: Mining cohesive patterns from graphs with feature vectors. In: SDM, pp. 593\u2013604 (2009)","DOI":"10.1137\/1.9781611972795.51"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: KDD, pp. 228\u2013238 (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Ulitsky, I., Shamir, R.: Identification of functional modules using network topology and high-throughput data. BMC Systems Biology\u00a01(1) (2007)","DOI":"10.1186\/1752-0509-1-8"},{"issue":"1","key":"46_CR19","first-page":"718","volume":"2","author":"Y. Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. PVLDB\u00a02(1), 718\u2013729 (2009)","journal-title":"PVLDB"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Clustering large attributed graphs: An efficient incremental approach. In: ICDM, pp. 689\u2013698 (2010)","DOI":"10.1109\/ICDM.2010.41"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23780-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T21:55:32Z","timestamp":1741470932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-23780-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237799","9783642237805"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23780-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}