| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
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.
Cited literature [11 references]
https://hal.inria.fr/hal-00640938
Contributor : Mehdi Kaytoue <>
Submitted on : Monday, November 14, 2011 - 4:29:14 PM
Last modification on : Wednesday, August 19, 2020 - 4:08:02 PM
Long-term archiving on: : Friday, November 16, 2012 - 10:51:46 AM
Contributor : Mehdi Kaytoue <>
Submitted on : Monday, November 14, 2011 - 4:29:14 PM
Last modification on : Wednesday, August 19, 2020 - 4:08:02 PM
Long-term archiving on: : Friday, November 16, 2012 - 10:51:46 AM
Files
zav1.pdf
Publisher files allowed on an open archive