Maximum split clustering under connectivity constraints
From MaRDI portal
Publication:1762820
DOI10.1007/s00357-003-0011-7zbMath1083.91063OpenAlexW2073247434MaRDI QIDQ1762820
Christophe Meyer, Bruno Simeone, Valeria Doring, Brigitte Jaumard, Pierre Hansen
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)
Related Items
An overview of graph covering and partitioning, Clustering on trees, Comparison to two ascendant hierarchical classification criteria under a contiguity constraint. Application to image processing, Uniform and most uniform partitions of trees, Local search algorithms for political districting, Agglomerative connectivity constrained clustering for image segmentation, Computing sharp bounds for hard clustering problems on trees