Sciweavers

1325 search results - page 65 / 265
» An Approach to Generation of Decision Rules
Sort
View
AIPS
2004
15 years 7 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
15 years 11 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
NIPS
2008
15 years 7 months ago
Support Vector Machines with a Reject Option
We consider the problem of binary classification where the classifier may abstain instead of classifying each observation. The Bayes decision rule for this setup, known as Chow�...
Yves Grandvalet, Alain Rakotomamonjy, Joseph Keshe...
ICLP
1992
Springer
15 years 10 months ago
Weighted Decision Trees
: Whiledecision tree compilationis a promisingway tocarry out guard tests e ciently, the methods given in the literature do not take into account either the execution characteristi...
Saumya K. Debray, Sampath Kannan, Mukul Paithane
NIPS
2004
15 years 7 months ago
Coarticulation in Markov Decision Processes
We investigate an approach for simultaneously committing to multiple activities, each modeled as a temporally extended action in a semi-Markov decision process (SMDP). For each ac...
Khashayar Rohanimanesh, Robert Platt Jr., Sridhar ...