{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:25:31Z","timestamp":1770978331453,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540200857","type":"print"},{"value":"9783540398042","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39804-2_23","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:06:45Z","timestamp":1277698005000},"page":"241-252","source":"Crossref","is-referenced-by-count":29,"title":["Ranking Interesting Subspaces for Clustering High Dimensional Data"],"prefix":"10.1007","author":[{"given":"Karin","family":"Kailing","sequence":"first","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[]},{"given":"Stefanie","family":"Wanka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","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. ACM SIGMOD Int. Conf. on Management of Data, Seattle, WA (1998)","DOI":"10.1145\/276304.276314"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Procopiuc, C.: Fast Algorithms for Projected Clustering. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Philadelphia, PA (1999)","DOI":"10.1145\/304182.304188"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., Yu, P.: Finding Generalized Projected Clusters in High Dimensional Space. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Dallas, TX (2000)","DOI":"10.1145\/342009.335383"},{"key":"23_CR4","unstructured":"Hinneburg, A., Keim, D.: Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering. In: Proc. 25th Int. Conf. on Very Large Databases, Edinburgh, Scotland (1999)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, C.H., Fu, A.C., Zhang, Y.: Entropy-Based Subspace Clustering for Mining Numerical Data. In: Proc. ACM SIGKDD Int. Conf. on Knowledge Discovery in Databases, San Diego, FL (1999)","DOI":"10.1145\/312129.312199"},{"key":"23_CR6","unstructured":"Goil, S., Nagesh, H., Choudhary, A.: MAFIA: Efficiant and Scalable Subspace Clustering for Very Large Data Sets. Tech. Report No. CPDC-TR-9906-010, Center for Parallel and Distributed Computing, Dept. of Electrical and Computer Engineering, Northwestern University (1999)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Procopiuc, C.M., Jones, M., Agarwal, P.K., Murali, T.M.: A Monte Carlo Algorithm for Fast Projective Clustering. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Madison, WI, pp. 418\u2013427 (2002)","DOI":"10.1145\/564691.564739"},{"key":"23_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: Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, pp. 291\u2013316 (1996)"},{"key":"23_CR9","unstructured":"Hinneburg, A., Keim, D.A.: An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In: Proc. 4th Int. Conf. on Knowledge Discovery and Data Mining, New York City, NY, pp. 224\u2013228 (1998)"},{"key":"23_CR10","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. ACM SIGMOD Int. Conf. on Management of Data, Philadelphia, PA, pp. 49\u201360 (1999)","DOI":"10.1145\/304182.304187"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D.A., Kriegel, H.P.: A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. In: Proc. ACM PODS Symp. on Principles of Database Systems, Tucson, AZ, pp. 78\u201386 (1997)","DOI":"10.1145\/263661.263671"},{"key":"23_CR12","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Minneapolis, MN, pp. 94\u2013105 (1994)"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1091\/mbc.9.12.3273","volume":"9","author":"P. Spellman","year":"1998","unstructured":"Spellman, P., Sherlock, G., Zhang, M., Iyer, V., Anders, K., Eisen, M., Brown, P., Botstein, D., Futcher, B.: Comprehensive Identification of Cell Cycle-Regulated Genes of the Yeast Saccharomyces Cerevisiae by Microarray Hybridization. Molecular Biolology of the Cell\u00a09, 3273\u20133297 (1998)","journal-title":"Molecular Biolology of the Cell"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39804-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:36:01Z","timestamp":1559223361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39804-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200857","9783540398042"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39804-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}