Sciweavers

219 search results - page 30 / 44
» Learning the Dimensionality of Hidden Variables
Sort
View
UAI
2003
15 years 1 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
UAI
2004
15 years 1 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
IDA
2003
Springer
15 years 4 months ago
Learning Dynamic Bayesian Networks from Multivariate Time Series with Changing Dependencies
Abstract. Many examples exist of multivariate time series where dependencies between variables change over time. If these changing dependencies are not taken into account, any mode...
Allan Tucker, Xiaohui Liu
MM
2005
ACM
139views Multimedia» more  MM 2005»
15 years 5 months ago
Multimodal affect recognition in learning environments
We propose a multi-sensor affect recognition system and evaluate it on the challenging task of classifying interest (or disinterest) in children trying to solve an educational pu...
Ashish Kapoor, Rosalind W. Picard
NIPS
2008
15 years 1 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang