Efficient algorithms for divisive hierarchical clustering with the diameter criterion

DOI10.1007/BF02616245zbMath0739.62050MaRDI QIDQ1176597

E. Guénoche, Brigitte Jaumard, Pierre Hansen

Publication date: 25 June 1992

Published in: Journal of Classification (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmspolynomial algorithmagglomerative hierarchical algorithmdiameter criteriondivisive hierarchical clustering algorithmshierarchy of partitions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25)

Related Items (12)

Quantum annealing for combinatorial clustering ⋮ Cluster analysis and mathematical programming ⋮ Sequential clustering with radius and split criteria ⋮ The weighted sum of split and diameter clustering ⋮ Fast agglomerative clustering using information of \(k\)-nearest neighbors ⋮ Partitioning hard clustering algorithms based on multiple dissimilarity matrices ⋮ Enumeration of the partitions with minimum diameter ⋮ Identifying genuine clusters in a classification ⋮ DIVCLUS-T: a monothetic divisive hierarchical clustering method ⋮ A graph b-coloring framework for data clustering ⋮ Espaliers: A generalization of dendrograms ⋮ An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

Uses Software

• heapsort

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Minimum sum of diameters clustering
• Enumeration of the partitions with minimum diameter
• Efficient algorithms for agglomerative hierarchical clustering methods
• A cutting plane algorithm for a clustering problem
• Monotone invariant clustering procedures
• A Survey of Recent Advances in Hierarchical Clustering Algorithms
• Bicriterion Cluster Analysis
• Algorithmic complexity: threeNP- hard problems in computational statistics
• An efficient algorithm for a complete link method
• Dissimilarity Analysis: a new Technique of Hierarchical Sub-division
• Cluster Analysis and Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for divisive hierarchical clustering with the diameter criterion