Skip to main content

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

  • Conference paper
Data Analysis, Classification, and Related Methods
  • 1839 Accesses

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • 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 

  • BANDELT, H.J. and DRESS A.W.M. (1994): An order theoretic framework for overlapping clustering. Discrete Math., 136, 21–37.

    Article  Google Scholar 

  • BATBEDAT, A. (1989): Les dissimilarités Médas et Arbas, Stat. Anal. Données, 14, 1–18.

    Google Scholar 

  • BATBEDAT, A. (1990): Les Approches Pyramidales Dans La Classification Arborée. Masson, Paris.

    Google Scholar 

  • DIATTA, J. (1998): Approximating dissimilarities by quasi-ultrametrics. Discrete Math. 192, 81–86.

    Article  Google Scholar 

  • 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 

  • DIATTA, J. and FICHET B. (1998): Quasi-ultrametrics and their 2-ball hypergraphs Discrete Math. 192, 87–102.

    Article  Google Scholar 

  • JARDINE, N. and SIBSON R. (1971) Mathematical Taxonomy, Wiley, London.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Fichet, B. (2000). A Short Optimal Way for Constructing Quasi-ultrametrics From Some Particular Dissimilarities. In: Kiers, H.A.L., Rasson, JP., Groenen, P.J.F., Schader, M. (eds) Data Analysis, Classification, and Related Methods. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59789-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59789-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67521-1

  • Online ISBN: 978-3-642-59789-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics