Maximum sum-of-splits clustering
From MaRDI portal
Publication:583774
DOI10.1007/BF01908598zbMath0692.62054MaRDI QIDQ583774
Publication date: 1989
Published in: Journal of Classification (Search for Journal in Brave)
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)
Related Items (4)
Cluster analysis and mathematical programming ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints ⋮ Constructing optimal ultrametrics ⋮ Set partition by globally optimized cluster seed points
Cites Work
- Minimum sum of diameters clustering
- Data analysis implications of some concepts related to the cuts of a graph
- Bicriterion Cluster Analysis
- SPANNING TREES AND ASPECTS OF CLUSTERING
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum sum-of-splits clustering