Comparing classification tree structures : a special case of comparing -ary relations II
Comparing classification tree structures: A special case of comparing -ary relations II
Comparing -ary relations on a set 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 4-ary relation. The most classical approaches to tree comparison are discussed in the context of...
Page 1