Advertisement

A Short Optimal Way for Constructing Quasi-ultrametrics From Some Particular Dissimilarities

  • B. Fichet
Conference paper
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)

Abstract

Recently, Diatta has established a lower maximal quasi-ultrametric approximation of a dissimilarity fulfilling the inclusion condition. The approach is purely algorithmical, but incidentally the solution is characterised by a formula. From this formula, we give here two straightforward and short proofs of the result. One is based on the properties of the dissimilarities under consideration, and the second one derives from the bijection between quasi-ultrametrics and indexed quasi-hierarchies.

Keywords

Discrete Math Level Index Cluster Partition Inclusion Condition Dissimilarity Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BANDELT, H.J. (1992): Four point characterization of the dissimilarity functions obtained from indexed closed weak hierarchies, Mathematisches Seminar, Universität Hamburg, Germany.Google Scholar
  2. BANDELT, H.J. and DRESS A.W.M. (1989): Weak hierarchies associated with similarity measures: an additive clustering technique. Bull. Math. Biol., 51, 113–166.Google Scholar
  3. BANDELT, H.J. and DRESS A.W.M. (1994): An order theoretic framework for overlapping clustering. Discrete Math., 136, 21–37.CrossRefGoogle Scholar
  4. BATBEDAT, A. (1989): Les dissimilarités Médas et Arbas, Stat. Anal. Données, 14, 1–18.Google Scholar
  5. BATBEDAT, A. (1990): Les Approches Pyramidales Dans La Classification Arborée. Masson, Paris.Google Scholar
  6. DIATTA, J. (1998): Approximating dissimilarities by quasi-ultrametrics. Discrete Math. 192, 81–86.CrossRefGoogle Scholar
  7. DIATTA, J. and FICHET B. (1994): From Apresjan hierarchies and Bandelt-Dress weak hierarchies to quasi-hierarchies. In: E. Diday et al (Eds) New approaches in Classification and Data Analysis, Springer, Berlin, 111–118.Google Scholar
  8. DIATTA, J. and FICHET B. (1998): Quasi-ultrametrics and their 2-ball hypergraphs Discrete Math. 192, 87–102.CrossRefGoogle Scholar
  9. JARDINE, N. and SIBSON R. (1971) Mathematical Taxonomy, Wiley, London.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 2000

Authors and Affiliations

  • B. Fichet
    • 1
  1. 1.Laboratoire de BiomathématiquesAix-Marseille II UniversityMarseille, Cedex 5France

Personalised recommendations