2 search results - page 1 / 1 » Occam's Razor and a Non-Syntactic Measure of Decision Tree C... |
AAAI
2004
15 years 2 months ago
2004
ENT ABSTRACTS
84
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...