Extracting Decision Trees from Interval Pattern Concept Lattices

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00640938
Contributor : Mehdi Kaytoue <>
Submitted on : Monday, November 14, 2011 - 4:29:14 PM
Last modification on : Thursday, January 11, 2018 - 6:19:54 AM
Long-term archiving on : Friday, November 16, 2012 - 10:51:46 AM

Files

zav1.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00640938, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

468

Files downloads

241