Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- 1 January 1991
- journal article
- Published by Springer Nature in Journal of Classification
- Vol. 8 (1) , 5-30
- https://doi.org/10.1007/bf02616245
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Minimum sum of diameters clusteringJournal of Classification, 1987
- Efficient algorithms for agglomerative hierarchical clustering methodsJournal of Classification, 1984
- Complete-Link Cluster Analysis by Graph ColoringJournal of the American Statistical Association, 1978
- An efficient algorithm for a complete link methodThe Computer Journal, 1977
- Cluster Analysis and Mathematical ProgrammingJournal of the American Statistical Association, 1971
- Cluster Analysis and Mathematical ProgrammingJournal of the American Statistical Association, 1971
- Dissimilarity Analysis: a new Technique of Hierarchical Sub-divisionNature, 1964
- AlgorithmsCommunications of the ACM, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956