The weighted sum of split and diameter clustering

DOI10.1007/BF01246100zbMATH Open0874.92040OpenAlexW2015522885MaRDI QIDQ1126399FDOQ1126399

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

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

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)

Cites Work

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

Cited In (12)

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

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)