Hierarchical Clustering Schemes

Citations Over TimeTop 1% of 1967 papers

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.”

Related Papers

• → Toward Applying Agglomerative Hierarchical Clustering in Improving the Software Development Effort Estimation(2022)7 cited
• → Generalized -invexity and generalized -invariant-monotonicity(2007)7 cited
• → 7. Hierarchical Clustering Techniques(2007)5 cited
• → Alternative hierarchical clustering approach in construction of phylogenetic trees(2009)3 cited
• A Grid-based Hierarchical Clustering Algorithm(2009)