{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:26:05Z","timestamp":1768343165192,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier","isbn-type":[{"value":"9780127224428","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1016\/b978-012722442-8\/50047-1","type":"book-chapter","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T08:42:39Z","timestamp":1188895359000},"page":"452-463","source":"Crossref","is-referenced-by-count":7,"title":["Data Bubbles for Non-Vector Data"],"prefix":"10.1016","author":[{"given":"Jianjun","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Sander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-012722442-8\/50047-1_bib1","first-page":"49","article-title":"OPTICS: Ordering Points To Identify the Clustering Structure","author":"Ankerst","year":"1999"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib2","first-page":"9","article-title":"Scaling Clustering Algorithms to Large Databases","author":"Bradley","year":"1998"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib3","first-page":"79","article-title":"Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering","author":"Breunig","year":"2001"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib4","first-page":"6","article-title":"Sqashing Flat Files Flatter","author":"DuMouchel","year":"1999"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib5","first-page":"163","article-title":"Fastmap: A fast algorithm for indexing, datamining and visualization of traditional and multimedia databases","author":"Faloutsos","year":"1995"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib6","first-page":"502","article-title":"Clustering Large Datasets in Arbitrary Metric Spaces","author":"Ganti","year":"1999"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib7","series-title":"Algorithms for Clustering Data","author":"Jain","year":"1988"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib8","first-page":"293","article-title":"Mining top-n local outliers in large databases","author":"Jin","year":"2001"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib9","series-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"Kaufman","year":"1990"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib10","first-page":"281","article-title":"Some Methods for Classification and Analysis of Multivariate Observations","volume":"Vol. 1","author":"MacQueen","year":"1967"},{"issue":"No. 1","key":"10.1016\/B978-012722442-8\/50047-1_bib11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","article-title":"SLINK: an optimally efficient algorithm for the single-link cluster method","volume":"Vol. 16","author":"Sibson","year":"1973","journal-title":"The Computer Journal"},{"key":"10.1016\/B978-012722442-8\/50047-1_bib12","first-page":"103","article-title":"BIRCH: An Efficient Data Clustering Method for Very Large Databases","author":"Zhang","year":"1996"}],"container-title":["Proceedings 2003 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T16:22:31Z","timestamp":1546618951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780127224428500471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9780127224428"],"references-count":12,"URL":"https:\/\/doi.org\/10.1016\/b978-012722442-8\/50047-1","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}