Minimum sum of diameters clustering

DOI10.1007/BF01896987zbMath0689.62042WikidataQ56288389 ScholiaQ56288389MaRDI QIDQ581969

Pierre Hansen

Publication date: 1987

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

zbMATH Keywords

complexitypartitionpolynomial algorithmdiametersdivisive hierarchical clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (12)

Cluster analysis and mathematical programming ⋮ The weighted sum of split and diameter clustering ⋮ A multistage view on 2-satisfiability ⋮ Dynamic clustering to minimize the sum of radii ⋮ Efficient algorithms for divisive hierarchical clustering with the diameter criterion ⋮ On minimum sum of radii and diameters clustering ⋮ Enumeration of the partitions with minimum diameter ⋮ Genetic clustering algorithms. ⋮ Maximum sum-of-splits clustering ⋮ Unnamed Item ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints ⋮ Set partition by globally optimized cluster seed points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Hierarchical clustering schemes
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• Bicriterion Cluster Analysis
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Cluster Analysis and Mathematical Programming

This page was built for publication: Minimum sum of diameters clustering