Elsevier

Information Processing Letters

Volume 104, Issue 6, 16 December 2007, Pages 205-210
Information Processing Letters

Optimal implementations of UPGMA and other common clustering algorithms

https://doi.org/10.1016/j.ipl.2007.07.002Get rights and content

Abstract

In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’).

References (20)

  • Z. Du et al.

    A novel parallelization approach for hierarchical clustering

    Parallel Comput.

    (2005)
  • M. Křivánek

    The complexity of ultrametric partitions on graphs

    Inform. Process. Lett.

    (1988)
  • C. Olson

    Parallel algorithms for hierarchical clustering

    Parallel Comput.

    (1995)
  • S. Akella et al.

    Accelerating phylogenetics computing on the desktop: experiments with executing UPGMA in programmable logic

  • J. Barthelemy et al.

    Trees and Proximities Representations

    (1991)
  • J. Benzécri

    Construction d'une classification ascendante hiérarchique par la recherche en chaîne des voisins réciproques

    Les Cahiers de l'Analyse des Données

    (1982)
  • W. Day et al.

    Efficient algorithms for agglomerative hierarchical clustering methods

    J. of Classification

    (1984)
  • C. Ding, X. He, Cluster aggregate inequality and multi-level hierarchical clustering, in: European Conference on...
  • R. Edgar, MUSCLE: multiple sequence alignment with high accuracy and high throughput, Nucl. Acids Res. 32...
  • I. Elias et al.

    Fast neighbor joining

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

Cited by (151)

View all citing articles on Scopus
View full text