{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:44Z","timestamp":1725456344359},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029980","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"368-377","source":"Crossref","is-referenced-by-count":0,"title":["Optimal algorithms for complete linkage clustering in d dimensions"],"prefix":"10.1007","author":[{"given":"Drago","family":"Krznaric","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"P. Arabie, L. J. Hubert, and G. De Soete, editors. Clustering and Classification. World Scientific, 1996.","DOI":"10.1142\/1930"},{"key":"37_CR2","volume-title":"Voronoi diagrams. Technical Report 198-5, Informatik","author":"F. Aurenhammer","year":"1996","unstructured":"F. Aurenhammer and R. Klein. Voronoi diagrams. Technical Report 198-5, Informatik, FernUniversit\u00e4t, Hagen, Germany, 1996."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"S. N. Bespamyatnikh. An optimal algorithm for closest pair maintenance. In Proceedings of the 11th Annual ACM Symposium on Computational Geometry, pages 152\u2013161, 1995.","DOI":"10.1145\/220279.220296"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01890115","volume":"1","author":"W. H. E. Day","year":"1984","unstructured":"W. H. E. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification, 1(1):7\u201324, 1984.","journal-title":"Journal of Classification"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","volume":"20","author":"D. Defays","year":"1977","unstructured":"D. Defays. An efficient algorithm for a complete link method. Computer Journal, 20:364\u2013366, 1977.","journal-title":"Computer Journal"},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"623","DOI":"10.2307\/2528417","volume":"23","author":"J. C. Gower","year":"1967","unstructured":"J. C. Gower. A comparison of some methods of cluster analysis. Biometrics, 23:623\u2013638, 1967.","journal-title":"Biometrics"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"D. Krznaric and C. Levcopoulos. The first subquadratic algorithm for complete linkage clustering. In Proceedings of ISAAC '95, LNCS 1004, pages 392\u2013401. Springer, 1995.","DOI":"10.1007\/BFb0015445"},{"issue":"3","key":"37_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0031-3203(91)90062-A","volume":"24","author":"T. Kurita","year":"1991","unstructured":"T. Kurita. An efficient agglomerative clustering algorithm using a heap. Pattern Recognition, 24(3):205\u2013209, 1991.","journal-title":"Pattern Recognition"},{"key":"37_CR9","unstructured":"K\u0159iv\u00e1nek. Connected admissible hierarchical clustering. Paper presented at the DIANA III conference, Bechyne, Czechoslovakia, June 1990."},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1038\/212218a0","volume":"212","author":"G. N. Lance","year":"1966","unstructured":"G. N. Lance and W. T. Williams. A generalised sorting strategy for computer classifications. Nature, 212:218, 1966.","journal-title":"Nature"},{"issue":"11","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/34.61708","volume":"12","author":"X. Li","year":"1990","unstructured":"X. Li. Parallel algorithms for hierarchical clustering and cluster validity. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(11):1088\u20131092, 1990.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"37_CR12","first-page":"101","volume":"1","author":"F. Murtagh","year":"1984","unstructured":"F. Murtagh. Complexities of hierarchic clustering algorithms: State of the art. Computational Statistics Quarterly, 1:101\u2013113, 1984.","journal-title":"Quarterly"},{"key":"37_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985."},{"key":"37_CR14","first-page":"1409","volume":"38","author":"R. R. Sokal","year":"1958","unstructured":"R. R. Sokal and C. D. Michener. A statistical method for evaluating systematic relationships. University of Kansas Science Bulletin, 38:1409\u20131438, 1958.","journal-title":"University of Kansas Science Bulletin"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:22:29Z","timestamp":1586593349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0029980","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}