Extracting Decision Trees from Interval Pattern Concept Lattices - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Extracting Decision Trees from Interval Pattern Concept Lattices


Formal Concept Analysis (FCA) and concept lattices have shown their e ffectiveness for binary clustering and concept learning. Moreover, several links between FCA and unsupervised data mining tasks such as itemset mining and association rules extraction have been emphasized. Several works also studied FCA in a supervised framework, showing that popular machine learning tools such as decision trees can be extracted from concept lattices. In this paper, we investigate the links between FCA and decision trees with numerical data. Recent works showed the effciency of "pattern structures" to handle numerical data in FCA, compared to traditional discretization methods such as conceptual scaling.
Fichier principal
Vignette du fichier
zav1.pdf (181.93 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00640938 , version 1 (14-11-2011)


  • HAL Id : hal-00640938 , version 1


Zainab Assaghir, Mehdi Kaytoue, Wagner Meira, Jean Villerd. Extracting Decision Trees from Interval Pattern Concept Lattices. The Eighth International Conference on Concept Lattices and their Applications - CLA 2011, INRIA Nancy Grand Est - LORIA, Oct 2011, Nancy, France. ⟨hal-00640938⟩
322 View
161 Download


Gmail Facebook X LinkedIn More