Maximum sum-of-splits clustering
DOI10.1007/BF01908598zbMATH Open0692.62054MaRDI QIDQ583774FDOQ583774
Authors: Jianyong Qiao, Sumit K. Garg 
Publication date: 1989
Published in: Journal of Classification (Search for Journal in Brave)
Recommendations
complexitypolynomial algorithmaverage split of the clustersdual graph of the single-linkage dendrogrammatrix of dissimilaritiesmaximum sum-of-splits partitionssingle- linkage algorithm
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph theory with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Bicriterion Cluster Analysis
- Title not available (Why is that?)
- Minimum sum of diameters clustering
- Title not available (Why is that?)
- Data analysis implications of some concepts related to the cuts of a graph
- SPANNING TREES AND ASPECTS OF CLUSTERING
Cited In (10)
- Cluster analysis and mathematical programming
- A structured family of clustering and tree construction methods
- Constructing optimal ultrametrics
- Maximum split clustering under connectivity constraints
- Title not available (Why is that?)
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Set partition by globally optimized cluster seed points
- DESPOTA: an algorithm to detect the partition in the extended hierarchy of a dendrogram
- A ``maximum-path-based classification
This page was built for publication: Maximum sum-of-splits clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583774)
