The weighted sum of split and diameter clustering

DOI10.1007/BF01246100zbMath0874.92040OpenAlexW2015522885MaRDI QIDQ1126399

S. H. Smith

Publication date: 11 November 1997

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

Full work available at URL: https://doi.org/10.1007/bf01246100

zbMATH Keywords

NP-hardpolynomial algorithmdivisive hierarchical clusteringbicriterion objective functionmaximum split clusteringminimum diameter clusteringPareto optimal bipartitions

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)

Related Items (4)

Constrained clustering by constraint programming ⋮ DIVCLUS-T: a monothetic divisive hierarchical clustering method ⋮ A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum sum of diameters clustering
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Data analysis implications of some concepts related to the cuts of a graph
• Hierarchical clustering schemes
• The Constrained Bottleneck Problem in Networks
• Bicriterion Cluster Analysis
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Cluster Analysis and Mathematical Programming
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: The weighted sum of split and diameter clustering