Sciweavers

2300 search results - page 176 / 460
» Learning Dialogue POMDP Models from Data
Sort
View
FLAIRS
2004
15 years 6 months ago
A Faster Algorithm for Generalized Multiple-Instance Learning
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
Qingping Tao, Stephen D. Scott
129
Voted
FLAIRS
2006
15 years 6 months ago
Decomposing Local Probability Distributions in Bayesian Networks for Improved Inference and Parameter Learning
A major difficulty in building Bayesian network models is the size of conditional probability tables, which grow exponentially in the number of parents. One way of dealing with th...
Adam Zagorecki, Mark Voortman, Marek J. Druzdzel
175
Voted
AAAI
2012
13 years 7 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
ICMI
2003
Springer
96views Biometrics» more  ICMI 2003»
15 years 9 months ago
Learning and reasoning about interruption
We present methods for inferring the cost of interrupting users based on multiple streams of events including information generated by interactions with computing devices, visual ...
Eric Horvitz, Johnson Apacible
129
Voted
ICML
2007
IEEE
16 years 5 months ago
Percentile optimization in uncertain Markov decision processes with application to efficient exploration
Markov decision processes are an effective tool in modeling decision-making in uncertain dynamic environments. Since the parameters of these models are typically estimated from da...
Erick Delage, Shie Mannor