Maximum split clustering under connectivity constraints

DOI10.1007/S00357-003-0011-7MaRDI QIDQ1762820zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Brigitte Jaumard, Christophe Meyer, Bruno Simeone, Valeria Doring

Publication date 11 February 2005

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

Full work available at URL https://doi.org/10.1007/s00357-003-0011-7

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)

Recommendations

• Maximum sum-of-splits clustering
• Clustering on trees
• A spanning tree heuristic for regional clustering
• Computing sharp bounds for hard clustering problems on trees
• The weighted sum of split and diameter clustering

Cited in

(11)

• An overview of graph covering and partitioning
• Local search algorithms for political districting
• Agglomerative connectivity constrained clustering for image segmentation
• Clustering on trees
• Maximum sum-of-splits clustering
• Uniform and most uniform partitions of trees
• Monothetic divisive clustering with geographical constraints
• Computing sharp bounds for hard clustering problems on trees
• A spanning tree heuristic for regional clustering
• Bayesian contiguity constrained clustering
• Comparison to two ascendant hierarchical classification criteria under a contiguity constraint. Application to image processing

This page was built for publication: Maximum split clustering under connectivity constraints

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