Name
Abstract | ||
|---|---|---|
In many clustering systems (hierarchies, pyramids and more generally weak hierarchies) clusters are generated by two elements only. This paper is devoted to such clustering systems (called binary clustering systems). It provides some basic properties, links with (closed) weak hierarchies and some qualitative versions of bijection theorems that occur in Numerical Taxonomy. Moreover, a way to associate a binary clustering system to every clustering system is discussed. Finally, introducing the notion of weak ultrametrics, a bijection between indexed weak hierarchies and weak ultrametrics is obtained (the standard theorem involves closed weak hierarchies and quasi-ultrametrics). |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.dam.2007.05.024 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
standard theorem,clustering system,Clustering system,basic property,weak hierarchy,weak ultrametrics,Weak hierarchy,bijection theorem,binary clustering system,Boolean dissimilarity,qualitative version,Numerical Taxonomy | Journal | 156 |
Issue | ISSN | Citations |
8 | Discrete Applied Mathematics | 3 |
PageRank | References | Authors |
0.46 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Pierre Barthélemy | 1 | 149 | 16.42 |
| François Brucker | 2 | 39 | 4.04 |