A Comparison of Two Approaches to Beta-Flexible Clustering
- 1 July 1992
- journal article
- Published by Taylor & Francis in Multivariate Behavioral Research
- Vol. 27 (3) , 417-433
- https://doi.org/10.1207/s15327906mbr2703_6
Abstract
We introduce a UPGMA based counterpart to the Lance and Williams (1966) p-flexible clustering strategy. This new method is compared with the original p-flexible technique based on WPGMA for a range of fl values from -0.8 to +0.1. Recovery of the known cluster structure from simulated data was evaluated using the Hubert and Arabie (1985) version of the Rand statistic. The algorithm used to generate the simulated clusters in the study included error-free data as well as three other error conditions. The simulated data also varied the number of clusters, the underlying dimensionality, and the density distribution of points to the clusters. Results showed that the flexible UPGMA gives the best recovery for all generated data configurations. Further, the flexible UPGMA method with a small negative β value performed better than the standard UPGMA method where β is set equal to zero. The flexible UPGMA strategy, employed with a narrow β range, is recommended based upon its ability to recover cluster structure ov...Keywords
This publication has 16 references indexed in Scilit:
- Compositional dissimilarity as a robust measure of ecological distancePlant Ecology, 1987
- Comparing partitionsJournal of Classification, 1985
- An Algorithm for Generating Artificial Test ClustersPsychometrika, 1985
- Fuse: A FORTRAN V program for agglomerative fusion for minicomputersComputers & Geosciences, 1984
- A Review Of Monte Carlo Tests Of Cluster AnalysisMultivariate Behavioral Research, 1981
- An Examination of the Effect of Six Types of Error Perturbation on Fifteen Clustering AlgorithmsPsychometrika, 1980
- Mixture Model Tests Of Hierarchical Clustering Algorithms: The Problem Of Classifying EverybodyMultivariate Behavioral Research, 1979
- On the Cophenetic Correlation CoefficientSystematic Zoology, 1969
- A General Theory of Classificatory Sorting Strategies: 1. Hierarchical SystemsThe Computer Journal, 1967
- A Generalized Sorting Strategy for Computer ClassificationsNature, 1966