A combinatorial approach to assess the separability of clusters

DOI10.1007/s00357-012-9098-zzbMath1360.62319OpenAlexW2062965910MaRDI QIDQ263327

M. João Martins, Pedro C. Silva, Jorge Orestes Cerdeira

Publication date: 4 April 2016

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

Full work available at URL: https://doi.org/10.1007/s00357-012-9098-z

zbMATH Keywords

combinatoricscluster analysisconvex hullsminimum spanning forests

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Related Items (3)

Local and overall deviance R-squared measures for mixtures of generalized linear models ⋮ A confusion index for measuring separation and clustering ⋮ Cluster validation for mixtures of regressions via the total sum of squares decomposition

Uses Software

• Silhouettes

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Cluster analysis and mathematical programming
• Well-Separated Clusters and Optimal Fuzzy Partitions
• Hybrid k-Means: Combining Regression-Wise and Centroid-Based Criteria for QSAR
• On clustering validation techniques

This page was built for publication: A combinatorial approach to assess the separability of clusters