{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T01:51:52Z","timestamp":1762998712103,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694762"},{"type":"electronic","value":"9783540694977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69497-7_41","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"580-585","source":"Crossref","is-referenced-by-count":48,"title":["ELKI: A Software System for Evaluation of Subspace Clustering Algorithms"],"prefix":"10.1007","author":[{"given":"Elke","family":"Achtert","sequence":"first","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","volume-title":"Data Mining: Practical machine learning tools and techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)","edition":"2"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Mierswa, I., Wurst, M., Klinkenberg, R., Scholz, M., Euler, T.: YALE: Rapid prototyping for complex data mining tasks. In: Proc.KDD (2006)","DOI":"10.1145\/1150402.1150531"},{"key":"41_CR3","unstructured":"Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Proc.VLDB (1995)"},{"issue":"1","key":"41_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R. Sibson","year":"1973","unstructured":"Sibson, R.: SLINK: An optimally efficient algorithm for the single-link cluster method. The Computer Journal\u00a016(1), 30\u201334 (1973)","journal-title":"The Computer Journal"},{"key":"41_CR5","unstructured":"McQueen, J.: Some methods for classification and analysis of multivariate observations. In: 5th Berkeley Symposium on Mathematics, Statistics, and Probabilistics, vol.\u00a01, pp. 281\u2013297 (1967)"},{"issue":"1","key":"41_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B\u00a039(1), 1\u201331 (1977)","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"41_CR7","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc.KDD (1996)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Ert\u00f6z, L., Steinbach, M., Kumar, V.: Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: Proc.SDM (2003)","DOI":"10.1137\/1.9781611972733.5"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: OPTICS: Ordering points to identify the clustering structure. In: Proc.SIGMOD (1999)","DOI":"10.1145\/304182.304187"},{"key":"41_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11731139_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"E. Achtert","year":"2006","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P.: DeLiClu: Boosting robustness, completeness, usability, and efficiency of hierarchical clustering by a closest pair ranking. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol.\u00a03918, pp. 119\u2013128. Springer, Heidelberg (2006)"},{"key":"41_CR11","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: Proc.SIGMOD (1998)","DOI":"10.1145\/276304.276314"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Procopiuc, C.M., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proc. SIGMOD (1999)","DOI":"10.1145\/304182.304188"},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Secure Data Management","author":"K. Kailing","year":"2004","unstructured":"Kailing, K., Kriegel, H.P., Kr\u00f6ger, P.: Density-connected subspace clustering for high-dimensional data. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2004. LNCS, vol.\u00a03178. Springer, Heidelberg (2004)"},{"key":"41_CR14","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Advances in Data Mining","author":"C. B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Kailing, K., Kriegel, H.P., Kr\u00f6ger, P.: Density connected clustering with local subspace preferences. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol.\u00a03275. Springer, Heidelberg (2004)"},{"key":"41_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/11871637_42","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"E. Achtert","year":"2006","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H.P., Kr\u00f6ger, P., M\u00fcller-Gorman, I., Zimek, A.: Finding hierarchies of subspace clusters. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 446\u2013453. Springer, Heidelberg (2006)"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-71703-4_15","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"E. Achtert","year":"2007","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H.P., Kr\u00f6ger, P., M\u00fcller-Gorman, I., Zimek, A.: Detection and visualization of subspace cluster hierarchies. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol.\u00a04443, pp. 152\u2013163. Springer, Heidelberg (2007)"},{"key":"41_CR17","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proc. ISMB (2000)"},{"key":"41_CR18","unstructured":"Yang, J., Wang, W., Wang, H., Yu, P.S.: \u03b4-clusters: Capturing subspace correlation in a large data set. In: Proc. ICDE (2002)"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Wang, H., Wang, W., Yang, J., Yu, P.S.: Clustering by pattern similarity in large data sets. In: Proc. SIGMOD (2002)","DOI":"10.1145\/564691.564737"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Finding generalized projected clusters in high dimensional space. In: Proc. SIGMOD (2000)","DOI":"10.1145\/342009.335383"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Kailing, K., Kr\u00f6ger, P., Zimek, A.: Computing clusters of correlation connected objects. In: Proc. SIGMOD (2004)","DOI":"10.1145\/1007568.1007620"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P., Zimek, A.: Mining hierarchies of correlation clusters. In: Proc. SSDBM (2006)","DOI":"10.1007\/11871637_42"},{"key":"41_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Secure Data Management","author":"E. Achtert","year":"2007","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H.P., Kr\u00f6ger, P., Zimek, A.: Robust, complete, and efficient correlation clustering. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2007. LNCS, vol.\u00a04721. Springer, Heidelberg (2007)"},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H.P., Kr\u00f6ger, P., Zimek, A.: On exploring complex relationships of correlation clusters. In: Proc. SSDBM (2007)","DOI":"10.1109\/SSDBM.2007.21"},{"key":"41_CR25","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., David, J., Kr\u00f6ger, P., Zimek, A.: Robust clustering in arbitrarily oriented subspaces. In: Proc. SDM (2008)","DOI":"10.1137\/1.9781611972788.69"},{"key":"41_CR26","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: A general framework for increasing the robustness of PCA-based correlation clustering algorithms. In: Proc. SSDBM (2008)"},{"key":"41_CR27","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-Tree: an efficient access method for similarity search in metric spaces. In: Proc. VLDB (1997)","DOI":"10.1145\/275487.275495"},{"key":"41_CR28","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: Proc.SIGMOD (2006)","DOI":"10.1145\/1142473.1142531"},{"key":"41_CR29","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00d6hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Approximate reverse k-nearest neighbor search in general metric spaces. In: Proc. CIKM (2006)","DOI":"10.1145\/1183614.1183731"},{"key":"41_CR30","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An efficient and robust access method for points and rectangles. In: Proc. SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"41_CR31","unstructured":"Yang, C., Lin, K.I.: An index structure for efficient reverse nearest neighbor queries. In: Proc. ICDE (2001)"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69497-7_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:01:52Z","timestamp":1738324912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69497-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694762","9783540694977"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69497-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}