Geodesic
Analytic complexity of cluster trees
Prikladnaâ diskretnaâ matematika, no. 2 (2014), pp. 79-87

Voir la notice de l'article provenant de la source Math-Net.Ru

The notion of the analytic complexity of a binary tree is introduced. This is a nonnegative integer reflecting the combinatorial structure of a tree and its most concise analytic representation. The properties of the analytic complexity of a tree are described, and how to calculate it algorithmically is explained. The developed methods are used to compare cluster trees.
Keywords: cluster analysis, binary tree, analytic complexity. 
@article{PDM_2014_2_a5,
     author = {A. I. Normov and T. M. Sadykov},
     title = {Analytic complexity of cluster trees},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {79--87},
     publisher = {mathdoc},
     number = {2},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2014_2_a5/}
}
TY  - JOUR
AU  - A. I. Normov
AU  - T. M. Sadykov
TI  - Analytic complexity of cluster trees
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2014
SP  - 79
EP  - 87
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2014_2_a5/
LA  - ru
ID  - PDM_2014_2_a5
ER  - 
%0 Journal Article
%A A. I. Normov
%A T. M. Sadykov
%T Analytic complexity of cluster trees
%J Prikladnaâ diskretnaâ matematika
%D 2014
%P 79-87
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2014_2_a5/
%G ru
%F PDM_2014_2_a5
A. I. Normov; T. M. Sadykov. Analytic complexity of cluster trees. Prikladnaâ diskretnaâ matematika, no. 2 (2014), pp. 79-87. http://geodesic.mathdoc.fr/item/PDM_2014_2_a5/