An efficient agglomerative clustering algorithm using a heap

https://doi.org/10.1016/0031-3203(91)90062-AGet rights and content

Abstract

An efficient algorithm for agglomerative clustering is presented. The algorithm uses a heap in which distances of all pairs of clusters are stored. Then the nearest pair of clusters is given by the element of the root node of the binary tree corresponding to the heap. Updating the heap at each stage of the hierarchy is easily implemented by shifting up or down the elements of the heap along the path of the heap tree. The computation time of the algorithm is at most O(N2 log(N)) when N objects are going to be classified.

References (7)

  • M.R. Anderberg

    Cluster Analysis for Applications

    (1973)
  • H. Späth

    Cluster Analysis Algorithms: for data reduction and classification of objects

    (1980)
  • T. Linde et al.

    An algorithm for vector quantizer design

    IEEE Trans. Comm. COM-28

    (1980)
There are more references available in the full text version of this article.

Cited by (107)

  • Parallel random swap: An efficient and reliable clustering algorithm in java

    2023, Simulation Modelling Practice and Theory
    Citation Excerpt :

    The more it is repeated, the higher is the chance to find a good solution. Agglomerative clustering (AC) generates the solution by a sequence of cluster merge operations (bottom-up approach) [13,14]. At each step, the pair of clusters is merged which increases the objective function cost least.

  • A scalable approach for the efficient segmentation of hyperspectral images

    2021, Chemometrics and Intelligent Laboratory Systems
  • 2.25 - Common Clustering Algorithms

    2020, Comprehensive Chemometrics: Chemical and Biochemical Data Analysis, Second Edition: Four Volume Set
View all citing articles on Scopus
View full text