Formal Concept Analysis (FCA) and concept lattices have shown their eectiveness 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 be- tween FCA and decision trees with numerical data. Recent works showed the eciency of "pattern structures" to handle numerical data in FCA, compared to traditional discretization methods such as conceptual scal- ing.
['Zainab Assaghir', 'Mehdi Kaytoue', 'Wagner Meira', 'Jean Villerd']
Extracting Decision Trees from Interval Pattern Concept Lattices