Sciweavers

15485 search results - page 2653 / 3097
» Computing Optimal Subsets
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
ICML
2008
IEEE
16 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICML
2006
IEEE
16 years 7 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
ICML
2005
IEEE
16 years 7 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
ICML
2005
IEEE
16 years 7 months ago
Discriminative versus generative parameter and structure learning of Bayesian network classifiers
In this paper, we compare both discriminative and generative parameter learning on both discriminatively and generatively structured Bayesian network classifiers. We use either ma...
Franz Pernkopf, Jeff A. Bilmes
« Prev « First page 2653 / 3097 Last » Next »