Sciweavers

459 search results - page 67 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
JMS
2010
90views more  JMS 2010»
13 years 6 months ago
Prediction of Clinical Conditions after Coronary Bypass Surgery using Dynamic Data Analysis
This work studies the impact of using dynamic information as features in a machine learning algorithm for the prediction task of classifying critically ill patients in two classes ...
Kristien Van Loon, Fabián Güiza, Geert...
ICML
2009
IEEE
14 years 8 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
VIP
2003
13 years 9 months ago
Optimal Selection of Image Segmentation Algorithms Based on Performance Prediction
Using different algorithms to segment different images is a quite straightforward strategy for automated image segmentation. But the difficulty of the optimal algorithm selection ...
Yong Xia, David Dagan Feng, Rongchun Zhao
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 7 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel