Min and Max Hierarchical Clustering using Asymmetric Similarity Measures

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.