The Community for Technology Leaders
Green Image
<p>In the above-titled paper, parallel implementations of hierarchical clustering algorithms that achieve O(n/sup 2/) computational time complexity and thereby improve on the baseline of sequential implementations are described. The latter are stated to be O(n/sup 3/), with the exception of the single-link method. The commenter points out that state-of-the-art hierarchical clustering algorithms have O(n/sup 2/) time complexity and should be referred to in preference to the O(n/sup 3/) algorithms, which were described in many texts in the 1970s. Some further references in the parallelizing of hierarchic clustering algorithms are provided.</p>
parallel algorithms; pattern recognition; hierarchical clustering; cluster validity; computational time complexity; single-link method; computational complexity; parallel algorithms; pattern recognition
F. Murtaugh, "Comments on 'Parallel Algorithms for Hierarchical Clustering and Cluster Validity'", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 14, no. , pp. 1056-1057, October 1992, doi:10.1109/34.159908
95 ms
(Ver 3.3 (11022016))