A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
From MaRDI portal
Publication:4105115
DOI10.2307/2286853zbMath0337.62037OpenAlexW4232419892MaRDI QIDQ4105115
Lawrence J. Hubert, Frank B. Baker
Publication date: 1976
Full work available at URL: https://doi.org/10.2307/2286853
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Monte Carlo methods (65C05) Graph theory (05C99)
Related Items
Validity studies in clustering methodologies ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses ⋮ Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices ⋮ The comparison and fitting of given classification schemes ⋮ Constructing blockmodels: how and why ⋮ Comparison of Chernoff-type face and non-graphical methods for clustering multivariate observations
This page was built for publication: A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
