Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T02:33:36.189Z Has data issue: false hasContentIssue false

Some Extensions of Johnson's Hierarchical Clustering Algorithms

Published online by Cambridge University Press:  01 January 2025

Lawrence Hubert*
Affiliation:
University of Wisconsin

Abstract

Considerable attention has been given in the psychological literature to techniques of data reduction that partition a set of objects into optimally homogeneous groups. This paper is an attempt to extend the hierarchical partitioning algorithms proposed by Johnson and to emphasize a general connection between these clustering procedures and the mathematical theory of lattices. A goodness-of-fit statistic is first proposed that is invariant under monotone increasing transformations of the basic similarity matrix. This statistic is then applied to three illustrative hierarchical clusterings: two obtained by the Johnson algorithms and one obtained by an algorithm that produces the same chain under hypermonotone increasing transformations of the similarity measures.

Information

Type
Original Paper
Copyright
Copyright © 1972 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable