Sciweavers

18 search results - page 1 / 4
» Inducing Decision Trees via Concept Lattices
Sort
View
CLA
2007
13 years 6 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
DATAMINE
2010
166views more  DATAMINE 2010»
13 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 probl...
Siegfried Nijssen, Élisa Fromont
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 5 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
ICML
1996
IEEE
14 years 5 months ago
Learning Relational Concepts with Decision Trees
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
Peter Geibel, Fritz Wysotzki
ICML
1996
IEEE
13 years 9 months ago
Second Tier for Decision Trees
A learner's performance does not rely only on the representation language and on the algorithm inducing a hypothesis in this language. Also the way the induced hypothesis is ...
Miroslav Kubat