{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T14:10:23Z","timestamp":1738332623807,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874805"},{"type":"electronic","value":"9783540874812"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87481-2_44","type":"book-chapter","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T23:30:46Z","timestamp":1218670246000},"page":"666-671","source":"Crossref","is-referenced-by-count":2,"title":["Pleiades: Subspace Clustering and Evaluation"],"prefix":"10.1007","author":[{"given":"Ira","family":"Assent","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Ralph","family":"Krieger","sequence":"additional","affiliation":[]},{"given":"Timm","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbors meaningful. In: Proceedings International Conference on Database Theory (ICDT), pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"1","key":"44_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L. Parsons","year":"2004","unstructured":"Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. ACM SIGKDD Explorations Newsletter\u00a06(1), 90\u2013105 (2004)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"44_CR3","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"I. Witten","year":"2005","unstructured":"Witten, I., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann Publishers Inc., San Francisco (2005)"},{"key":"44_CR4","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: Proceedings ACM SIGMOD International Conference on Management of Data, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Sequeira, K., Zaki, M.: SCHISM: A new approach for interesting subspace mining. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 186\u2013193 (2004)","DOI":"10.1109\/ICDM.2004.10099"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H.P., Kr\u00f6ger, P.: Density-connected subspace clustering for high-dimensional data. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 246\u2013257 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Kailing, K., Kriegel, H.P., Kr\u00f6ger, P.: Density connected clustering with local subspace preferences. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 27\u201334 (2004)","DOI":"10.1109\/ICDM.2004.10087"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Assent, I., Krieger, R., M\u00fcller, E., Seidl, T.: DUSC: Dimensionality unbiased subspace clustering. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 409\u2013414 (2007)","DOI":"10.1109\/ICDM.2007.49"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., Wolf, J., Yu, P., Procopiuc, C., Park, J.: Fast algorithms for projected clustering. In: Proceedings ACM SIGMOD International Conference on Management of Data, pp. 61\u201372 (1999)","DOI":"10.1145\/304181.304188"},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/ICDM.2006.123","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM)","author":"G. Moise","year":"2006","unstructured":"Moise, G., Sander, J., Ester, M.: P3C: A robust projected clustering algorithm. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 414\u2013425. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Zimmermann, A.: The chosen few: On identifying valuable patterns. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 63\u201372 (2007)","DOI":"10.1109\/ICDM.2007.85"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87481-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T13:33:52Z","timestamp":1738330432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87481-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874805","9783540874812"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87481-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}