Skip to main content

Trees and Hierarchical Structures

Proceedings of a Conference held at Bielefeld, FRG, Oct. 5–9th, 1987

  • Conference proceedings
  • © 1990

Overview

Part of the book series: Lecture Notes in Biomathematics (LNBM, volume 84)

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

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 papers)

Keywords

About this book

The "raison d'etre" of hierarchical dustering theory stems from one basic phe­ nomenon: This is the notorious non-transitivity of similarity relations. In spite of the fact that very often two objects may be quite similar to a third without being that similar to each other, one still wants to dassify objects according to their similarity. This should be achieved by grouping them into a hierarchy of non-overlapping dusters such that any two objects in ~ne duster appear to be more related to each other than they are to objects outside this duster. In everyday life, as well as in essentially every field of scientific investigation, there is an urge to reduce complexity by recognizing and establishing reasonable das­ sification schemes. Unfortunately, this is counterbalanced by the experience of seemingly unavoidable deadlocks caused by the existence of sequences of objects, each comparatively similar to the next, but the last rather different from the first.

Editors and Affiliations

  • Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany

    Andreas Dress

  • Department of Mathematics DRB 306, University of Southern California, Los Angeles, USA

    Arndt Haeseler

Bibliographic Information

Publish with us