An efficient agglomerative clustering algorithm using a heap
References (7)
Cluster Analysis for Applications
(1973)Cluster Analysis Algorithms: for data reduction and classification of objects
(1980)- 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 TheoryCitation 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 SystemsData-driven fault detection process using correlation based clustering
2020, Computers in Industry2.25 - Common Clustering Algorithms
2020, Comprehensive Chemometrics: Chemical and Biochemical Data Analysis, Second Edition: Four Volume SetProximity-Aware Hierarchical Clustering of unconstrained faces
2018, Image and Vision Computing
Copyright © 1991 Published by Elsevier B.V.