Comparing Classification tree Structures : a Special Case of Comparing q-Ary Relations

Israël-César Lerman 1
1 REPCO - Knowledge Representation
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : Comparing q-ary relations on a set O of elementary objects is one of the most fundamental problems of classification and combinatorial data analysis. In this paper the specific comparison task that involves classification tree structures (binary or not) is considered in this context. Two mathematical representations are proposed. One is defined in terms of a weighted binary relation; the second uses a four-ary relation. The most classical approaches to tree comparison, are discussed in the contex of a set theoretic representation of these relations. Formal and combinatorial computing aspects of a construction method fo a very general family of association coefficients between relations are presented. The main purpose of this article is to specify the components of this construction, based on a permutational procedure, when the structures to be compared are classification trees.
Type de document :
[Research Report] RR-3167, INRIA. 1997
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:06:53
Dernière modification le : vendredi 16 novembre 2018 - 01:23:32
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:49:09



  • HAL Id : inria-00073521, version 1


Israël-César Lerman. Comparing Classification tree Structures : a Special Case of Comparing q-Ary Relations. [Research Report] RR-3167, INRIA. 1997. 〈inria-00073521〉



Consultations de la notice


Téléchargements de fichiers