Highest Entry Hierarchical Clustering

Abstract

This paper develops and illustrates the most rapid method yet reported for hierarchically clustering the n objects of a matrix which portrays the interrelation of every object to every other object, where n equals any number up to 1000 and even larger. Results compare favorably with those from other excellent methods.