Efficient algorithms for agglomerative hierarchical clustering methods
- 1 December 1984
- journal article
- research article
- Published by Springer Nature in Journal of Classification
- Vol. 1 (1) , 7-24
- https://doi.org/10.1007/bf01890115
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A Survey of Recent Advances in Hierarchical Clustering AlgorithmsThe Computer Journal, 1983
- Note on Ultrametric Hierarchical Clustering AlgorithmsPsychometrika, 1981
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning TreesJournal of the ACM, 1979
- A mathematical comparison of the members of an infinite family of agglomerative clustering algorithmsThe Canadian Journal of Statistics / La Revue Canadienne de Statistique, 1979
- An efficient algorithm for a complete link methodThe Computer Journal, 1977
- HIERARCHICAL CLUSTERING AND THE CONCEPT OF SPACE DISTORTIONBritish Journal of Mathematical and Statistical Psychology, 1975
- A Review of ClassificationJournal of the Royal Statistical Society. Series A (General), 1971
- Minimum Spanning Trees and Single Linkage Cluster AnalysisJournal of the Royal Statistical Society Series C: Applied Statistics, 1969
- A General Theory of Classificatory Sorting Strategies: 1. Hierarchical SystemsThe Computer Journal, 1967
- On a conjecture of H. HadwigerPacific Journal of Mathematics, 1961