225 search results - page 18 / 45 » On Learning Decision Trees with Large Output Domains |
IJCAI
2007
13 years 9 months ago
2007
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
COLT
2001
Springer
14 years 7 days ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
IJCAI
2007
13 years 9 months ago
2007
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...