Comparing Classification tree Structures : a Special Case of Comparing q-Ary Relations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

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

Israël-César Lerman
  • Function : Author
  • PersonId : 831377

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.
Fichier principal
Vignette du fichier
RR-3167.pdf (334.08 Ko) Télécharger le fichier

Dates and versions

inria-00073521 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073521 , version 1

Cite

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⟩
43 View
134 Download

Share

Gmail Facebook Twitter LinkedIn More