Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
6. Hasse Diagrams Based on Transformed Data Matrices
verfasst von : Rainer Brüggemann, Ganapati P. Patil
Erschienen in: Ranking and Prioritization for Multi-indicator Systems
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
We have seen in Chapter 5 as to why and how the structure of partial order (X, IB) can be related to properties of the data matrix. However, partial order with many objects can lead to messy Hasse diagrams with too many lines hiding the structure. What may be the reason for complexity in such diagrams? The number of objects |X| is not necessarily causing messy Hasse diagrams because chains of height |X| or antichains of width |X| certainly allow clear visualizations. There is another reason for complexity: In partial orders, we obtain either x < y or x || y even if the numerical difference ɛ between attribute values is small: