Skip to content

Hierarchical Clustering Schemes

S. C. Johnson

Psychometrika · 1967 · 5,025 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Johnson, S. C. (1967). Hierarchical clustering schemes. Psychometrika, 32(3), 241–254. https://doi.org/10.1007/bf02289588

In text: (Johnson, 1967)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

Techniques for partitioning objects into optimally homogeneous groups on the basis of empirical measures of similarity among those objects have received increasing attention in several different fields. This paper develops a useful correspondence between any hierarchical system of such clusters, and a particular type of distance measure. The correspondence gives rise to two methods of clustering that are computationally rapid and invariant under monotonic transformations of the data. In an explicitly defined sense, one method forms clusters that are optimally “connected,” while the other forms clusters that are optimally “compact.”

  1. Regression Shrinkage and Selection Via the Lasso1996
  2. Maximum Likelihood from Incomplete Data Via the EM Algorithm1977
  3. Latent dirichlet allocation2003
  4. A tutorial on hidden Markov models and selected applications in speech recognition1989
  5. Statistical Analysis With Missing Data1989

Metadata from OpenAlex (CC0). Citations are generated from the published record.