Skip to main content
SpringerLink
Log in

The complete linkage clustering algorithm revisited

  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

A new algorithm for generating a symmetric min-transitive opening of a similarity relation is proposed. Since min-transitive similarity relations are in one-to-one correspondence to hierarchical partition trees, our algorithm can be compared to certain classical clustering algorithms. The new algorithm is efficient and the generated opening is in practical situations usually closer to the original relation than are the openings generated by other algorithms. Various tests illustrate the obtained results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Laboratory of Microbiology, Ghent University, Ledeganckstraat 35, B-9000, Gent, Belgium

    P. Dawyndt

  2. Dept. of Applied Mathematics and Computer Science, Ghent University, Krijgslaan 281 (S9), B-9000, Gent, Belgium

    H. De Meyer

  3. Dept. of Applied Mathematics, Biometrics and Process Control, Ghent University, Coupure links 653, B-9000, Gent, Belgium

    B. De Baets

Authors
  1. P. Dawyndt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. De Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. De Baets
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. De Meyer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

P. Dawyndt, Meyer, H. & Baets, B. The complete linkage clustering algorithm revisited. Soft Comput 9, 385–392 (2005). https://doi.org/10.1007/s00500-003-0346-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-003-0346-3

Keywords

Search

Navigation