Key points are not available for this paper at this time.
Abstract This article concerns the derivation and use of a measure of similarity between two hierarchical clusterings. The measure, Bk , is derived from the matching matrix, mij , formed by cutting the two hierarchical trees and counting the number of matching entries in the k clusters in each tree. The mean and variance of Bk are determined under the assumption that the margins of mij are fixed. Thus, Bk represents a collection of measures for k = 2, …, n – 1. (k, Bk ) plots are found to be useful in portraying the similarity of two clusterings. Bk is compared to other measures of similarity proposed respectively by Baker (1974) and Rand (1971). The use of (k, Bk ) plots for studying clustering methods is explored by a series of Monte Carlo sampling experiments. An example of the use of (k, Bk ) on real data is given.
Building similarity graph...
Analyzing shared references across papers
Loading...
Edward B. Fowlkes
Murray State University
C. L. Mallows
AT&T (United States)
Journal of the American Statistical Association
Bell (Canada)
Building similarity graph...
Analyzing shared references across papers
Loading...
Fowlkes et al. (Thu,) studied this question.
synapsesocial.com/papers/69dec24e7702a00918b0cb58 — DOI: https://doi.org/10.1080/01621459.1983.10478008