Sciweavers

49 search results - page 1 / 10
» Exact Inference of Hidden Structure from Sample Data in nois...
Sort
View
UAI
2003
13 years 6 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 ...
ICML
2008
IEEE
14 years 5 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 4 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
NIPS
1996
13 years 6 months ago
Continuous Sigmoidal Belief Networks Trained using Slice Sampling
Real-valued random hidden variables can be useful for modelling latent structure that explains correlations among observed variables. I propose a simple unit that adds zero-mean G...
Brendan J. Frey