Min and Max Hierarchical Clustering using Asymmetric Similarity Measures
- 1 March 1973
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 38 (1) , 63-72
- https://doi.org/10.1007/bf02291174
Abstract
The min and the max hierarchical clustering methods discussed by Johnson are extended to include the use of asymmetric similarity values. The first part of the paper presents the basic min and max procedures but in the context of graph theory; this description is then generalized to directed graphs as a way of introducing the less restrictive characterization of the original clustering techniques.Keywords
This publication has 5 references indexed in Scilit:
- Some Extensions of Johnson's Hierarchical Clustering AlgorithmsPsychometrika, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Hierarchical clustering schemesPsychometrika, 1967
- A Graph Theory Model for Systematic Biology, with an Example for the Oncidiinae (Orchidaceae)Systematic Zoology, 1966
- An Analysis of Perceptual Confusions Among Some English ConsonantsThe Journal of the Acoustical Society of America, 1955