Treillis dichotomiques et arbres de décision
Karell Bertet, Muriel Visani, Nathalie Girard · DSpace (Centre National De La Recherche Scientifique) · 2009
In this paper, we introduce a family of Galois lattice denoted as "dichotomic lattices". Such lattices are defined from binary attributes, where each binary attribute may be associated to a non-empty set of complementary attributes. In particular, lattices defined by binary attributes obtained after e discretisation pre-processing step are dichotomic. There are two types of classification methods using a Galois lattice: as most of them rely on selection, recent research work focus on navigation-based approaches. In navigation-oriented methods, classification is performed by navigating through the complete lattice, similar to the decision tree. The Navigala approach is a navigation-based classification method that relies on the use of a dichotomic lattice. It was initially proposed for symbol recognition, in the field of technical document image analysis. In this paper, we define the structural links between decision trees and dichotomic lattices defined from the same table of data described by binary attributes. Under this condition, we prove both that every decision tree is included in the dichotomic lattice and that the dichotomic lattice is the merger of all the decision trees that can be constructed from the same binary data table.