Name
Abstract | ||
|---|---|---|
Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural properties. The finding of structural patterns is of utmost importance to reduce the problem of understanding the structure-function relationships. Here we propose the analysis of similarity measures between nodes using hierarchical clustering methods. The discrete nature of the networks usually leads to a small set of different similarity values, making standard hierarchical clustering algorithms ambiguous. We propose the use of multidendrograms, an algorithm that computes agglomerative hierarchical clusterings implementing a variable-group technique that solves the non-uniqueness problem found in the standard pair-group algorithm. This problem arises when there are more than two clusters separated by the same maximum similarity (or minimum distance) during the agglomerative process. Forcing binary trees in this case means breaking ties in some way, thus giving rise to different output clusterings depending on the criterion used. Multidendrograms solves this problem by grouping more than two clusters at the same time when ties occur. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3390/e15125464 | ENTROPY |
Keywords | DocType | Volume |
patterns in networks,hierarchical clustering,dendrogram,uniqueness | Journal | 15 |
Issue | ISSN | Citations |
12 | 1099-4300 | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergio Gómez | 1 | 377 | 24.96 |
| Alberto Fernández | 2 | 110 | 9.20 |
| Clara Granell | 3 | 103 | 6.99 |
| Alexandre Arenas | 4 | 211 | 18.40 |