Hostname: page-component-7dd5485656-7jgsp Total loading time: 0 Render date: 2025-10-31T05:30:36.533Z Has data issue: false hasContentIssue false
  • English
  • Français

Note on Ultrametric Hierarchical Clustering Algorithms

Published online by Cambridge University Press:  01 January 2025

Vladimir Batagelj
Vladimir Batagelj*
Affiliation:
University Edvard Kardelj Ljubljana, Yugoslavia
*
Requests for reprints should he sent to Vladimir Batagelj, University Edvard Kardelj, Department of Mathematics, Jadranska 19, 61 000 Ljubljana, Yugoslavia.
Get access Rights & Permissions [Opens in a new window]

Abstract

Milligan presented the conditions that are required for a hierarchical clustering strategy to be monotonic, based on a formula by Lance and Williams. In the present paper, the statement of the conditions is improved and shown to provide necessary and sufficient conditions.

Keywords

monotonic hierarchical clustering strategies

Information

Type
Notes And Comments
Information
Psychometrika , Volume 46 , Issue 3 , September 1981 , pp. 351 - 352
Copyright
Copyright © 1981 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

Footnotes

This work was supported in part by the Boris Kidrič Fund, Yugoslavia.

References

Lance, G. N. & Williams, W. T. A general theory of classificatory sorting strategies, 1. Hierarchical systems. The Computer Journal, 1967, 9, 373–380.CrossRefGoogle Scholar
Milligan, G. W. Ultrametric hierarchical clustering algorithms. Psychometrika, 1979, 44, 343–346.CrossRefGoogle Scholar