Treffer: A clustering algorithm for huge trees
Title:
A clustering algorithm for huge trees
Source:
Advances in applied mathematics (Print). 31(1):46-60
Publisher Information:
San Diego, CA: Elsevier, 2003.
Publication Year:
2003
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Probabilités et statistiques, Probability and statistics, Statistiques, Statistics, Analyse multivariable, Multivariate analysis, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Arbre graphe, Tree(graph), Arbol grafo, Classification automatique (statistiques), Cluster analysis (statistics), Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Temps linéaire, Linear time, Tiempo lineal, Algorithme amas, Cluster algorithm, Statistique combinatoires, Combinatorial statistics, Visualisation information, Information visualization
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
LaBRI-Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence, France
ISSN:
0196-8858
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.14945185
Database:
PASCAL Archive
Weitere Informationen
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.