15 search results - page 2 / 3 » Anytime Induction of Decision Trees: An Iterative Improvemen... |
ICML
2009
IEEE
14 years 3 hour ago
2009
IEEE
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
ICML
2004
IEEE
14 years 6 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
DIS
2009
Springer
13 years 11 months ago
2009
Springer
Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...
ILP
2007
Springer
13 years 11 months ago
2007
Springer
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...