Why Do Internet Users Stick with a Specific Web Site? A Relationship Perspective
International Journal of Electronic Commerce
Clustering of Leaf-Labelled Trees
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
| Hi-index | 0.00 |
We present a new tree clustering algorithm based on combinatorial statistics on trees. Using well-known measures on trees giving the number of leaves of a subtree or the number of siblings of a node, we design a parameter that can be used to detect irregularities in a tree. We obtain a clustering approach for trees by implementing classical statistical tests on this parameter, thus providing well balanced drawings of trees offering better aspect ratios which can be useful when dealing with large, irregular hierarchical data. Our algorithm is linear in time and can thus be applied to large data structures. Moreover the larger the structure is the better the precision of the statistical tools.