{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T11:49:00Z","timestamp":1773920940996,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540410669","type":"print"},{"value":"9783540453727","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45372-5_23","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T03:21:49Z","timestamp":1186888909000},"page":"232-242","source":"Crossref","is-referenced-by-count":17,"title":["Fast Hierarchical Clustering Based on Compressed Data and OPTICS"],"prefix":"10.1007","author":[{"given":"Markus M.","family":"Breunig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Sander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Ankerst M., Breunig M. M., Kriegel H.-P., Sander J.: \u201cOPTICS: Ordering Points To Identify the Clustering Structure\u201d,Proc. ACM SIGMOD\u201999 Int. Conf. on Management of Data, Philadelphia, 1999, pp. 49\u201360.","DOI":"10.1145\/304181.304187"},{"key":"23_CR2","unstructured":"Bradley P. S., Fayyad U., Reina C.: \u201cScaling Clustering Algorithms to Large Databases\u201d, Proc.4th Int. Conf. on Knowledge Discovery and Data Mining, New York, NY, AAAI Press, 1998, pp. 9\u201315."},{"key":"23_CR3","unstructured":"Berchthold S., Keim D., Kriegel H.-P.: \u201cThe X-Tree: An Index Structure for High-Dimensional Data\u201d, 22nd Conf. on Very Large Data Bases, Bombay,India,1996, pp. 28\u201339."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"DuMouchel W., Volinsky C., Johnson T., Cortez C., Pregibon D.: \u201cSqashing Flat Files Flatter\u201d, Proc. 5th Int. Conf. on Knowledge Discovery and Data Mining, San Diego, CA, AAAI Press, 1999, pp. 6\u201315.","DOI":"10.1145\/312129.312184"},{"key":"23_CR5","unstructured":"Ester M., Kriegel H.-P., Sander J., Xu X.: \u201cA Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise\u201d, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, 1996, pp. 226\u2013231."},{"key":"23_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-60159-7_5","volume-title":"Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification","author":"M. Ester","year":"1995","unstructured":"Ester M., Kriegel H.-P., Xu X.: \u201cKnowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification\u201d, Proc. 4th Int. Symp. on Large Spatial Databases (SSD\u201995), Portland, ME, 1995, LNCS 591, Springer, 1995, pp. 67\u201382."},{"key":"23_CR7","unstructured":"Fayyad U., Piatetsky-Shapiro G., Smyth P.: \u201cKnowledge Discovery and Data Mining: Towards a Unifying Framework\u201d. Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, 1996, pp. 82\u201388."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Kaufman L., Rousseeuw P. J.: \u201cFinding Groups in Data: An Introduction to Cluster Analysis\u201d, John Wiley & Sons, 1990.","DOI":"10.1002\/9780470316801"},{"key":"23_CR9","unstructured":"MacQueen, J.: \u201cSome Methods for Classification and Analysis of Multivariate Observations\u201d, Proc. 5th Berkeley Symp. on Math. Statist. and Prob., Vol. 1, 1965, pp. 281\u2013297."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R. Sibson","year":"1973","unstructured":"Sibson R.: \u201cSLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method\u201d, The Computer Journal, Vol. 16, No. 1, 1973, pp. 30\u201334.","journal-title":"The Computer Journal"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Zhang T., Ramakrishnan R., Linvy M.: \u201cBIRCH: An Efficient Data Clustering Method for Very Large Databases\u201d, Proc. ACM SIGMOD Int. Conf. on Management of Data, ACM Press, New York, 1996, pp. 103\u2013114.","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45372-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:57:03Z","timestamp":1556740623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45372-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410669","9783540453727"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45372-5_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}