{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:09:55Z","timestamp":1725797395910},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1109\/icdm.2007.49","type":"proceedings-article","created":{"date-parts":[[2008,3,19]],"date-time":"2008-03-19T14:33:38Z","timestamp":1205937218000},"page":"409-414","source":"Crossref","is-referenced-by-count":75,"title":["DUSC: Dimensionality Unbiased Subspace Clustering"],"prefix":"10.1109","author":[{"given":"Ira","family":"Assent","sequence":"first","affiliation":[]},{"given":"Ralph","family":"Krieger","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"MAFIA: Efficient and scalable subspace clustering for very large data sets","author":"nagesh","year":"1999","journal-title":"TR 9906–010 NWU"},{"journal-title":"VCI repository of MLDBs","year":"1998","author":"newman","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2004.10099"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3324-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2006.01.005"},{"key":"ref4","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases","author":"ester","year":"1996","journal-title":"KDD"},{"key":"ref3","first-page":"217","article-title":"When is nearest neighbors meaningful","author":"beyer","year":"1999","journal-title":"ICDT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.23"},{"key":"ref5","first-page":"58","article-title":"An efficient approach to clustering in large multimedia databases with noise","author":"hinneburg","year":"1998","journal-title":"KDD"},{"key":"ref8","first-page":"882","article-title":"supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures","author":"keogh","year":"2006","journal-title":"VLDB"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39804-2_23"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2006.153"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.5"}],"event":{"name":"Seventh IEEE International Conference on Data Mining (ICDM 2007)","start":{"date-parts":[[2007,10,28]]},"location":"Omaha, NE, USA","end":{"date-parts":[[2007,10,31]]}},"container-title":["Seventh IEEE International Conference on Data Mining (ICDM 2007)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4470209\/4470210\/04470265.pdf?arnumber=4470265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T18:00:55Z","timestamp":1489687255000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4470265\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icdm.2007.49","relation":{},"subject":[],"published":{"date-parts":[[2007,10]]}}}