Sciweavers

225 search results - page 7 / 45
» On Learning Decision Trees with Large Output Domains
Sort
View
AUSAI
2006
Springer
15 years 9 months ago
Lazy Learning for Improving Ranking of Decision Trees
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...
Han Liang, Yuhong Yan
ECML
1993
Springer
15 years 10 months ago
SIA: A Supervised Inductive Algorithm with Genetic Search for Learning Attributes based Concepts
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...
Gilles Venturini
ICML
2006
IEEE
16 years 6 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
ICML
2001
IEEE
16 years 6 months ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan
ATAL
2009
Springer
16 years 15 days ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone