2 search results - page 1 / 1 » Why skewing works: learning difficult Boolean functions with... |
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...