Directed Binary Hierarchies and Directed Ultrametrics

Directed binary hierarchies have been introduced in order to give a graphical reduced representation of a family of association rules. This type of structure extends the classical binary hierarchical classification in a very specific way. In this paper an accurate formalization of this new structure...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of classification Ročník 28; číslo 3; s. 272 - 296
Hlavní autoři: Lerman, I-C., Kuntz, P.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer-Verlag 01.10.2011
Springer
Springer Nature B.V
Springer Verlag
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Automatic classification
Bioinformatics
Classification
Computer Science
Computer science; control theory; systems
Exact sciences and technology
Family structure
Hierarchic clustering
Hierarchies
Logic and foundations
Machine Learning
Marketing
Mathematical analysis
Mathematical logic, foundations, set theory
Mathematics
Mathematics and Statistics
Methods of scientific computing (including symbolic computation, algebraic computation)
Multivariate analysis
Numerical analysis. Scientific computation
Pattern Recognition
Probability and statistics
Psychometrics
Recursion theory
Sciences and techniques of general use
Signal,Image and Speech Processing
Statistical Theory and Methods
Statistics
Subsets
Theoretical computing
Directed hierarchical classification
Association rule representation
Data analysis
Factor analysis
Initial condition
Hierarchical classification
Statistical association
Multivariate analysis
Algorithm
Correspondence analysis
Graphic method
Directed graph
Principal component analysis
ISSN:0176-4268, 1432-1343
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Directed binary hierarchies have been introduced in order to give a graphical reduced representation of a family of association rules. This type of structure extends the classical binary hierarchical classification in a very specific way. In this paper an accurate formalization of this new structure is studied. A directed hierarchy is defined as a set of ordered pairs of subsets of the initial individual set satisfying specific conditions. A new notion of directed ultrametricity is studied. The main result consists in establishing a bijective correspondence between a directed ultrametric space and a directed binary hierarchy. Finally, an algorithm is proposed in order to transform a directed ultrametric structure into a graphical representation associated with a directed binary hierarchy.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0176-4268
1432-1343
DOI:10.1007/s00357-011-9091-y