A combinatorial approach to assess the separability of clusters

DOI10.1007/S00357-012-9098-ZMaRDI QIDQ263327zbMATH OpenOpenAlexFDO

Authors Pedro C. Silva, Jorge Orestes Cerdeira, M. J. Martins

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

cluster analysiscombinatoricsconvex hullsminimum spanning forests

Mathematics Subject Classification ID

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

Recommendations

• An approach to cluster separability in a partition
• Separation index and partial membership for clustering
• On separable clusterings
• A statistical approach to class separability
• On metric clustering

Cites work

• Cluster analysis and mathematical programming
• Hybrid k-Means: Combining Regression-Wise and Centroid-Based Criteria for QSAR
• On clustering validation techniques
• 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
• Well-Separated Clusters and Optimal Fuzzy Partitions

Cited in

(7)

• A novel optimization approach towards improving separability of clusters
• scientific article; zbMATH DE number 1934577 (Why is no real title available?)
• A statistical approach to class separability
• 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
• An approach to cluster separability in a partition

Describes a project that uses

Uses Software

• Silhouettes

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

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