The weighted sum of split and diameter clustering

DOI10.1007/BF01246100MaRDI QIDQ1126399zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Minimum sum of diameters clustering
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Splitting an ordering into a partition to minimize diameter
• Maximum sum-of-splits clustering

Cites work

• scientific article; zbMATH DE number 3945836 (Why is no real title available?)
• scientific article; zbMATH DE number 3672307 (Why is no real title available?)
• scientific article; zbMATH DE number 3258737 (Why is no real title available?)
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Bicriterion Cluster Analysis
• Cluster Analysis and Mathematical Programming
• Data analysis implications of some concepts related to the cuts of a graph
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Hierarchical clustering schemes
• Minimum sum of diameters clustering
• The Constrained Bottleneck Problem in Networks

Cited in

(12)

• Computing sharp bounds for hard clustering problems on trees
• Maximum split clustering under connectivity constraints
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Model selection for minimum-diameter partitioning
• A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks
• Algorithms and complexity of range clustering
• Maximum sum-of-splits clustering
• Constrained clustering by constraint programming
• A polynomial algorithm for balanced clustering via graph partitioning
• Sequential clustering with radius and split criteria
• DIVCLUS-T: a monothetic divisive hierarchical clustering method
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126399)