{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:53Z","timestamp":1725493673403},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_5","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"30-39","source":"Crossref","is-referenced-by-count":1,"title":["Geometric Algorithms for Agglomerative Hierarchical Clustering"],"prefix":"10.1007","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"P.K. Agarwal","year":"1991","unstructured":"P.K. Agarwal, H. Edelsbrunner, and O. Schwarzkopf, Euclidean Minimum Spanning Trees and Bichromatic Closet Pairs, Discrete Comput. Geom., 6 (1991), 407\u2013422.","journal-title":"Discrete Comput. Geom."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"S.W. Bent","year":"1985","unstructured":"S.W. Bent, D.D. Sleator, and R.E. Tarjan, Biased Search Tress, SIAM J. Comput., 14 (1985), 545\u2013568.","journal-title":"SIAM J. Comput."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/PL00009340","volume":"19","author":"S.N. Bespamyatnikh","year":"1998","unstructured":"S.N. Bespamyatnikh, An Optimal Algorithm for Closest Pair Maintenance, Discrete Comput. Geom., 19 (1998), 175\u2013195.","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1021\/ci9501047","volume":"36","author":"R.D. Brown","year":"1996","unstructured":"R.D. Brown and Y.C. Martin, Use of Structure-Activity Data to Compare Structure-Based Clustering Methods and Descriptors for Use in Compound Selection, J. Chem. Inf. Comput. Sci., 36(3) (1996), 572\u2013584.","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"5_CR5","volume-title":"Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications","author":"P.B. Callahan","year":"1995","unstructured":"P.B. Callahan, Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications, Ph.D. thesis, Dept. Comput. Sci., Johns Hopkins University, Baltimore, Maryland, 1995."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"P.B. Callahan and S.R. Kosaraju, A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields, J. ACM, 42 (1995), 67\u201390.","journal-title":"J. ACM"},{"issue":"4","key":"5_CR7","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/comjnl\/26.4.354","volume":"26","author":"F. Murtagh","year":"1983","unstructured":"F. Murtagh, A Survey of Recent Advances in Hierarchical Clustering Algorithms, The Computer Journal, 26(4) (1983), 354\u2013359.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:53:42Z","timestamp":1551023622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}