57 search results - page 7 / 12 » Learning Decision Trees with log Conditional Likelihood |
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
ML
2000
ACM
13 years 8 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in...
COLT
2001
Springer
14 years 1 months 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 ...
ECCC
2007
13 years 8 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...