Skip to main content

Abstract

The weakly indexed paired-hierarchies (shortly, p-hierarchies) provide a clustering model that allows overlapping clusters and extends the hierarchical model. There exists a bijection between weakly indexed p-hierarchies and the so-called paired-ultrametrics (shortly, p-ultrametrics), this correspondence being a restriction of the bijection between weakly indexed pyramids and Robinsonian dissimilarities. This paper proposes a generalization of the well-known HAC clustering method to compute a weakly indexed p-hierarchy from a given dissimilarity d. Moreover, the p-ultrametric associated to such a weakly indexed p-hierarchy is proved to be lower-maximal for d and larger than the sub-dominant ultrametric of d.

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., DRESS, A.W.M. (1989): Weak Hierarchies Associated with Similarity Measures — an Additive Clustering Technique. Bulletin of Mathematical Biology 51, 133–166.

    MATH  Google Scholar 

  • BATBEDAT, A. (1988): Les isomorphismes HTS et HTE (après la bijection de Benzécri-Johnson). Metron, 46, 47–59.

    MATH  Google Scholar 

  • BENZÉCRI, J.-P. (1973): L’Analyse des données: la Taxinomie, vol. 1. Dunod, Paris.

    MATH  Google Scholar 

  • BERTRAND, P. (2000): Set Systems and Dissimilarities. Europ. J. Combinatorics 21, 727–743.

    Article  MATH  Google Scholar 

  • BERTRAND, P. (2002): Set Systems for which Each Set Properly Intersects at Most One Other Set-Application to Pyramidal Clustering, cahier du Ceremade 0202, Univ. Paris-Dauphine, France.

    Google Scholar 

  • DIDAY, E. (1986): Orders and Overlapping Clusters in Pyramids. In: J. De Leeuw, W. Heiser, J. Meulman, and F. Critchley (Eds.): Multidimentional Data Analysis Proceedings. DSWO Press, Leiden, 201–234.

    Google Scholar 

  • FICHET, B. (1986): Data Analysis: Geometric and Algebric Structures. In: Y.A. Prohorov, and V.U. Sasonov (Eds.): First world congress of the Bernoulli Society proceedings. VNU Science Press, Utrecht, 123–132.

    Google Scholar 

  • JOHNSON, S.C. (1967): Hierarchical Clustering Schemes. Psychometrika 32, 241–254.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bertrand, P., Brucker, F. (2007). On Lower-Maximal Paired-Ultrametrics. In: Brito, P., Cucumel, G., Bertrand, P., de Carvalho, F. (eds) Selected Contributions in Data Analysis and Classification. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73560-1_42

Download citation

Publish with us

Policies and ethics