Sciweavers

Share
22 search results - page 1 / 5
» Mining optimal decision trees from itemset lattices
Sort
View
DATAMINE
2010
166views more  DATAMINE 2010»
9 years 7 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 probl...
Siegfried Nijssen, Élisa Fromont
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
10 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SAC
2006
ACM
10 years 28 days ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
FEGC
2008
104views Biometrics» more  FEGC 2008»
9 years 8 months ago
Mining Implications from Lattices of Closed Trees
We propose a way of extracting high-confidence association rules from datasets consisting of unlabeled trees. The antecedents are obtained through a computation akin to a hypergrap...
José L. Balcázar, Albert Bifet, Anto...
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
10 years 1 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
books