{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:48:55Z","timestamp":1725680935005},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,10,26]]},"DOI":"10.1145\/1458082.1458227","type":"proceedings-article","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T12:59:40Z","timestamp":1226408380000},"page":"1093-1102","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["EDSC"],"prefix":"10.1145","author":[{"given":"Ira","family":"Assent","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Ralph","family":"Krieger","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Emmanuel","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304188"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335383"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.49"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656271"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312199"},{"key":"e_1_3_2_1_7_1","first-page":"226","volume-title":"KDD","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases . In KDD , pages 226 -- 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. In KDD, pages 226--231, 1996."},{"key":"e_1_3_2_1_8_1","first-page":"58","volume-title":"KDD","author":"Hinneburg A.","year":"1998","unstructured":"A. Hinneburg and D. Keim . An efficient approach to clustering in large multimedia databases with noise . In KDD , pages 58 -- 65 , 1998 . A. Hinneburg and D. Keim. An efficient approach to clustering in large multimedia databases with noise. In KDD, pages 58--65, 1998."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.23"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39804-2_23"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9473(93)E0056-A"},{"key":"e_1_3_2_1_14_1","first-page":"281","volume-title":"Berkeley Symp. Math. stat. & prob.","author":"MacQueen J.","year":"1967","unstructured":"J. MacQueen . Some methods for classification and analysis of multivariate observations . In Berkeley Symp. Math. stat. & prob. , pages 281 -- 297 , 1967 . J. MacQueen. Some methods for classification and analysis of multivariate observations. In Berkeley Symp. Math. stat. & prob., pages 281--297, 1967."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.123"},{"key":"e_1_3_2_1_16_1","volume-title":"TR 9906--010","author":"Nagesh H.","year":"1999","unstructured":"H. Nagesh , S. Goil , and A. Choudhary . MAFIA: Efficient and scalable subspace clustering for very large data sets . In TR 9906--010 , NWU , 1999 . H. Nagesh, S. Goil, and A. Choudhary. MAFIA: Efficient and scalable subspace clustering for very large data sets. In TR 9906--010, NWU, 1999."},{"key":"e_1_3_2_1_17_1","volume-title":"UCI repository of MLDBs","author":"Newman D.","year":"1998","unstructured":"D. Newman , S. Hettich , C. Blake , and C. Merz . UCI repository of MLDBs , 1998 . D. Newman, S. Hettich, C. Blake, and C. Merz. UCI repository of MLDBs, 1998."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032649.1033453"},{"key":"e_1_3_2_1_19_1","volume-title":"USA","author":"Witten I.","year":"2005","unstructured":"I. Witten and E. Frank . Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann , USA , 2005 . I. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, USA, 2005."}],"event":{"name":"CIKM08: Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Napa Valley California USA","acronym":"CIKM08"},"container-title":["Proceedings of the 17th ACM conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1458082.1458227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T04:34:18Z","timestamp":1673498058000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1458082.1458227"}},"subtitle":["efficient density-based subspace clustering"],"short-title":[],"issued":{"date-parts":[[2008,10,26]]},"references-count":19,"alternative-id":["10.1145\/1458082.1458227","10.1145\/1458082"],"URL":"https:\/\/doi.org\/10.1145\/1458082.1458227","relation":{},"subject":[],"published":{"date-parts":[[2008,10,26]]},"assertion":[{"value":"2008-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}