Sciweavers

187 search results - page 17 / 38
» Bounding the cost of learned rules
Sort
View
CORR
2010
Springer
187views Education» more  CORR 2010»
13 years 8 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao
AAAI
2010
13 years 10 months ago
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
Carmel Domshlak, Erez Karpas, Shaul Markovitch
NIPS
2007
13 years 9 months ago
Regularized Boost for Semi-Supervised Learning
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
Ke Chen 0001, Shihai Wang
FLAIRS
2006
13 years 9 months ago
Machine Learning for Imbalanced Datasets: Application in Medical Diagnostic
In this paper, we present a new rule induction algorithm for machine learning in medical diagnosis. Medical datasets, as many other real-world datasets, exhibit an imbalanced clas...
Luis Mena, Jesus A. Gonzalez
AIPS
2009
13 years 9 months ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...