Sciweavers

Share
DATAMINE
2010

Optimal constraint-based decision tree induction from itemset lattices

10 years 4 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard problem of finding optimal decision trees in a wide range of applications by postprocessing a set of patterns: we use local patterns to construct a global model. We exploit the connection between constraints in pattern mining and constraints in decision tree induction to develop a framework for categorizing decision tree mining constraints. This framework allows us to determine which model constraints can be pushed deeply into the pattern mining process, and allows us to improve the state-of-the-art of optimal decision tree induction. Keywords Decision tree learning, Formal concepts, Frequent itemset mining, Constraint based mining
Siegfried Nijssen, Élisa Fromont
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where DATAMINE
Authors Siegfried Nijssen, Élisa Fromont
Comments (0)
books