{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:26:35Z","timestamp":1776889595984,"version":"3.51.2"},"reference-count":50,"publisher":"Elsevier","isbn-type":[{"value":"9780444862174","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1016\/s0169-7161(82)02015-x","type":"book-chapter","created":{"date-parts":[[2005,4,18]],"date-time":"2005-04-18T19:58:53Z","timestamp":1113854333000},"page":"267-284","source":"Crossref","is-referenced-by-count":36,"title":["12 Single-link clustering algorithms"],"prefix":"10.1016","author":[{"given":"F. James","family":"Rohlf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0169-7161(82)02015-X_bib1","series-title":"Cluster Analysis for Applications","author":"Anderberg","year":"1973"},{"key":"10.1016\/S0169-7161(82)02015-X_bib2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/S0169-7161(82)02015-X_bib3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TC.1978.1675043","article-title":"Fast algorithms for constructing minimal spanning trees in coordinate spaces","volume":"27","author":"Bentley","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0169-7161(82)02015-X_bib4","series-title":"Proc. Eighth ACM Symp. on the Theory of Computing","first-page":"220","article-title":"Divide-and-conquer in multidimensional space","author":"Bentley","year":"1976"},{"key":"10.1016\/S0169-7161(82)02015-X_bib5","series-title":"The Theory of Graphs and its Application","author":"Berge","year":"1966"},{"key":"10.1016\/S0169-7161(82)02015-X_bib6","series-title":"Programming, Games and Transportation Networks","author":"Berge","year":"1962"},{"key":"10.1016\/S0169-7161(82)02015-X_bib7","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0169-7161(82)02015-X_bib8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1093\/comjnl\/13.2.156","article-title":"An improved algorithm for the Jardine-Sibson method of generating overlapping clusters","volume":"13","author":"Cole","year":"1970","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib9","series-title":"Computer Programming in Quantitative Biology","author":"Davies","year":"1971"},{"key":"10.1016\/S0169-7161(82)02015-X_bib10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0169-7161(82)02015-X_bib11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1093\/biomet\/58.1.91","article-title":"Admissible clustering procedures","volume":"58","author":"Fisher","year":"1971","journal-title":"Biometrika"},{"key":"10.1016\/S0169-7161(82)02015-X_bib12","doi-asserted-by":"crossref","first-page":"282","DOI":"10.4064\/cm-2-3-4-282-285","article-title":"Sur la liason et la division des points d'un ensemble fini","volume":"2","author":"Florek","year":"1951","journal-title":"Colloq. Math."},{"key":"10.1016\/S0169-7161(82)02015-X_bib13","first-page":"193","article-title":"Taksonomia Wroclawska","volume":"17","author":"Florek","year":"1951","journal-title":"Przegl. Antropol."},{"key":"10.1016\/S0169-7161(82)02015-X_bib14","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2346439","article-title":"Minimum spanning trees and single-linkage cluster analysis","volume":"18","author":"Gower","year":"1969","journal-title":"Applied Statistics"},{"key":"10.1016\/S0169-7161(82)02015-X_bib15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02389716","article-title":"A cluster analysis based on graph theory","volume":"29","author":"van Groenewoud","year":"1974","journal-title":"Vegetatio"},{"key":"10.1016\/S0169-7161(82)02015-X_bib16","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1080\/01621459.1967.10500922","article-title":"Representation of similarity matrices by trees","volume":"62","author":"Hartigan","year":"1967","journal-title":"J. Amer. Stat. Assoc."},{"key":"10.1016\/S0169-7161(82)02015-X_bib17","series-title":"Clustering Algorithms","author":"Hartigan","year":"1975"},{"key":"10.1016\/S0169-7161(82)02015-X_bib18","series-title":"Classification and Clustering","first-page":"45","article-title":"Distributional problems in clustering","author":"Hartigan","year":"1977"},{"key":"10.1016\/S0169-7161(82)02015-X_bib19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0025-5564(67)90032-6","article-title":"The structure and construction of taxonomic hierarchies","volume":"1","author":"Jardine","year":"1967","journal-title":"Math. Biosci."},{"key":"10.1016\/S0169-7161(82)02015-X_bib20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1093\/comjnl\/11.2.177","article-title":"The construction of hierarchic and non-hierarchic classifications","volume":"11","author":"Jardine","year":"1968","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib21","series-title":"Mathematical Taxonomy","author":"Jardine","year":"1971"},{"key":"10.1016\/S0169-7161(82)02015-X_bib22","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02289588","article-title":"Hierarchical clustering schemes","volume":"32","author":"Johnson","year":"1967","journal-title":"Psychometrika"},{"key":"10.1016\/S0169-7161(82)02015-X_bib23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.2307\/2412309","article-title":"Functionpoint cluster analysis","volume":"22","author":"Katz","year":"1973","journal-title":"Systematic Zool."},{"key":"10.1016\/S0169-7161(82)02015-X_bib24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0031-3203(76)90026-1","article-title":"A locally sensitive method for cluster analysis","volume":"8","author":"Kittler","year":"1976","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0169-7161(82)02015-X_bib25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0031-3203(79)90031-1","article-title":"Comments on \u201csingle-link characteristics of a mode-seeking clustering algorithm\u201d","volume":"11","author":"Kittler","year":"1979","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0169-7161(82)02015-X_bib26","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/S0169-7161(82)02015-X_bib27","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1093\/comjnl\/9.4.373","article-title":"A general theory of classificatory sorting strategies, Part I. Hierarchical systems","volume":"9","author":"Lance","year":"1967","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1177\/001316445701700204","article-title":"Elementary linkage analysis for isolating orthogonal and oblique types and typal relevancies","volume":"17","author":"McQuitty","year":"1957","journal-title":"Educ. Psychol. Meas."},{"key":"10.1016\/S0169-7161(82)02015-X_bib29","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1093\/biomet\/60.2.422","article-title":"Admissible clustering procedures","volume":"60","author":"van Ness","year":"1973","journal-title":"Biometrika"},{"key":"10.1016\/S0169-7161(82)02015-X_bib30","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib31","series-title":"Algorithms and Complexity","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/S0169-7161(82)02015-X_bib32","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1093\/comjnl\/18.2.164","article-title":"A new approach to the computation of the Jardine-Sibson Bk clusters","volume":"18","author":"Rohlf","year":"1973","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib33","first-page":"93","article-title":"Algorithm 76, Hierarchical clustering using the minimum spanning tree","volume":"16","author":"Rohlf","year":"1973","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib34","first-page":"89","article-title":"Algorithm 81, dendrogram plot","volume":"17","author":"Rohlf","year":"1974","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib35","first-page":"90","article-title":"Note on Algorithm 81, dendrogram plot","volume":"18","author":"Rohlf","year":"1975","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib36","article-title":"Computational efficiency of agglomerative clustering algorithms","author":"Rohlf","year":"1977"},{"key":"10.1016\/S0169-7161(82)02015-X_bib37","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0020-0190(78)90039-X","article-title":"A probabilistic minimum spanning tree algorithm","volume":"7","author":"Rohlf","year":"1978","journal-title":"Information Processing Lett."},{"key":"10.1016\/S0169-7161(82)02015-X_bib38","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2346450","article-title":"Algorithms AS 13\u201315","volume":"18","author":"Ross","year":"1969","journal-title":"Appl. Statist."},{"key":"10.1016\/S0169-7161(82)02015-X_bib39","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0031-3203(79)90030-X","article-title":"Single-link characteristics of a mode-seeking clustering algorithm","volume":"11","author":"Shaffer","year":"1979","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0169-7161(82)02015-X_bib40","series-title":"Ph. D. dissertation","article-title":"Computational geometry","author":"Shamos","year":"1975"},{"key":"10.1016\/S0169-7161(82)02015-X_bib41","series-title":"Proc. 16th Annual IEEE Symposium on Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/S0169-7161(82)02015-X_bib42","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":"16","author":"Sibson","year":"1973","journal-title":"Comput. J."},{"key":"10.1016\/S0169-7161(82)02015-X_bib43","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1099\/00221287-17-1-201","article-title":"The applications of computers to taxonomy","volume":"17","author":"Sneath","year":"1957","journal-title":"J. Gen. Microbiol."},{"key":"10.1016\/S0169-7161(82)02015-X_bib44","series-title":"Numerical Taxonomy","author":"Sneath","year":"1973"},{"key":"10.1016\/S0169-7161(82)02015-X_bib45","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/361284.361299","article-title":"Algorithm 422, minimal spanning tree","volume":"15","author":"Whitney","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/S0169-7161(82)02015-X_bib46","doi-asserted-by":"crossref","first-page":"427","DOI":"10.2307\/2257960","article-title":"Multivariate methods in plant ecology. V. Similarity analyses and information-analysis","volume":"54","author":"Williams","year":"1966","journal-title":"J. Ecology"},{"key":"10.1016\/S0169-7161(82)02015-X_bib47","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","article-title":"An O(|E|log log |V|) algorithm for finding minimum spanning trees","volume":"4","author":"Yao","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/S0169-7161(82)02015-X_bib48","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(75)90044-7","article-title":"Finding near neighbors in k-dimensional space","volume":"3","author":"Yuval","year":"1975","journal-title":"Information Processing Lett."},{"key":"10.1016\/S0169-7161(82)02015-X_bib49","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(76)90064-8","article-title":"Finding nearest neighbors","volume":"5","author":"Yuval","year":"1976","journal-title":"Information Processing Lett."},{"key":"10.1016\/S0169-7161(82)02015-X_bib50","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","article-title":"Graph-theoretical methods for detecting and describing gestalt clusters","volume":"20","author":"Zahn","year":"1971","journal-title":"IEEE Trans. Comput."}],"container-title":["Handbook of Statistics","Classification Pattern Recognition and Reduction of Dimensionality"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T03:50:25Z","timestamp":1550116225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016971618202015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9780444862174"],"references-count":50,"URL":"https:\/\/doi.org\/10.1016\/s0169-7161(82)02015-x","relation":{},"ISSN":["0169-7161"],"issn-type":[{"value":"0169-7161","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}