Trees and Hierarchical Structures : Proceedings of a Conference held at Bielefeld, FRG, Oct. 5-9th, 1987

Arndt van Haeseler

ISBN 10: 3540524533 / ISBN 13: 9783540524533

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg, 1990

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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.

Codice articolo 9783540524533

Dati bibliografici

• Titolo: Trees and Hierarchical Structures : Proceedings of a Conference held at Bielefeld, FRG, Oct. 5-9th, 1987
• Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg
• Data di pubblicazione: 1990
• Lingua: Inglese
• ISBN 10: 3540524533
• ISBN 13: 9783540524533
• Rilegatura: Taschenbuch
• Condizione: Neu

Descrizione articolo

Riassunto

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.

Contenuti

1. Introduction.- 2. Reconstruction of Phylogenies by Distance Data: Mathematical Framework and Statistical Analysis.- 3. Additive-Tree Representations.- 4. Finding the Minimal Change in a Given Tree.- 5. Search, Parallelism, Comparison, and Evaluation: Algorithms for Evolutionary Trees.- 6. The Phylogeny of Prochloron: Is there Numerical Evidence from SAB Values? A Response to van Valen.- 7. Evolution of the Collagen Fibril by Duplication and Diversification of a Small Primordial Exon Unit.- 8. The Poincare Paradox and The Cluster Problem.- 9. An incremental Error Correcting Evaluation Algorithm for Recursion Networks without Circuits.