Maximum sum-of-splits clustering

DOI10.1007/BF01908598MaRDI QIDQ583774zbMATH OpenFDO

Authors Jianyong Qiao, Sumit K. Garg

Publication date 1989

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

zbMATH Keywords

complexitypolynomial algorithmaverage split of the clustersdual graph of the single-linkage dendrogrammatrix of dissimilaritiesmaximum sum-of-splits partitionssingle- linkage algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Maximum split clustering under connectivity constraints
• The weighted sum of split and diameter clustering
• A ``maximum-path-based classification
• Efficient algorithms for agglomerative hierarchical clustering methods
• Hierarchical clustering schemes

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3174053 (Why is no real title available?)
• scientific article; zbMATH DE number 3672307 (Why is no real title available?)
• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• scientific article; zbMATH DE number 3800808 (Why is no real title available?)
• scientific article; zbMATH DE number 867650 (Why is no real title available?)
• Bicriterion Cluster Analysis
• Data analysis implications of some concepts related to the cuts of a graph
• Graph theory with applications
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Minimum sum of diameters clustering
• 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
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
• scientific article; zbMATH DE number 4007498 (Why is no real title available?)
• 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)