132 search results - page 3 / 27 » Induction of Oblique Decision Trees |
DATAMINE
2010
14 years 9 months ago
2010
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...
194
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
KDD
1995
ACM
15 years 1 months ago
1995
ACM
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
POPL
2012
ACM
13 years 5 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...