96 search results - page 6 / 20 » An Evolutionary Algorithm for Oblique Decision Tree Inductio... |
SAC
2006
ACM
15 years 3 months ago
2006
ACM
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...
PAKDD
2001
ACM
15 years 1 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
100
click to vote
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
IDA
2000
Springer
14 years 9 months ago
2000
Springer
Conventional algorithms for decision tree induction use an attribute-value representation scheme for instances. This paper explores the empirical consequences of using set-valued ...
IJCAI
2003
14 years 10 months ago
2003
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...