Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073521
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:06:53 PM
Last modification on : Thursday, February 11, 2021 - 2:48:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:49:09 PM

Identifiers

  • HAL Id : inria-00073521, version 1

Citation

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⟩

Share

Metrics

Record views

137

Files downloads

272