Sciweavers

31 search results - page 3 / 7
» Sharpening Occam's Razor
Sort
View
ECML
1997
Springer
13 years 10 months ago
Conditions for Occam's Razor Applicability and Noise Elimination
Dragan Gamberger, Nada Lavrac
ECAI
2004
Springer
13 years 11 months ago
Simplicity in Solving the Frame Problem
Abstract. This paper presents an approach for reasoning about action and change which appeals to the principle of Occam’s razor— roughly stating that the simplest explanations ...
Victor Jauregui, Maurice Pagnucco, Norman Y. Foo
ICML
2007
IEEE
14 years 6 months ago
Sample compression bounds for decision trees
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...
Mohak Shah
COLT
2007
Springer
13 years 12 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret