Theory refinement on Bayesian networks
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
The EM algorithm for graphical association models with missing data
Computational Statistics & Data Analysis - Special issue dedicated to Toma´sˇ Havra´nek
A tutorial on learning with Bayesian networks
Learning in graphical models
Exploiting the architecture of dynamic systems
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Approximate learning of dynamic models
Proceedings of the 1998 conference on Advances in neural information processing systems II
Learning Belief Networks in the Presence of Missing Values and Hidden Variables
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Factorial Hidden Markov Models
Factorial Hidden Markov Models
The BATmobile: towards a Bayesian automated taxi
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Learning bayesian network structure from massive datasets: the «sparse candidate« algorithm
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Tractable inference for complex stochastic processes
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
The Bayesian structural EM algorithm
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Learning the structure of dynamic probabilistic networks
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Data perturbation for escaping local maxima in learning
Eighteenth national conference on Artificial intelligence
SINBAD automation of scientific discovery: From factor analysis to theory synthesis
Natural Computing: an international journal
Learning Hidden Variable Networks: The Information Bottleneck Approach
The Journal of Machine Learning Research
On-line alert systems for production plants: A conflict based approach
International Journal of Approximate Reasoning
Force deployment analysis with generalized grammar
Information Fusion
Learning partially observable action models: efficient algorithms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Learning partially observable deterministic action models
Journal of Artificial Intelligence Research
Learning partially observable deterministic action models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Optimal Prediction with Conditionally Heteroskedastic Factor Analysed Hidden Markov Models
Computational Economics
Model gene network by semi-fixed Bayesian network
Expert Systems with Applications: An International Journal
Latent variable study algorithm based on grey cluster relation analysis method
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Journal of Visual Communication and Image Representation
Learning bayesian network structure from massive datasets: the «sparse candidate« algorithm
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
The Information bottleneck EM algorithm
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Alert systems for production plants: a methodology based on conflict analysis
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Review: learning bayesian networks: Approaches and issues
The Knowledge Engineering Review
Hi-index | 0.00 |
Dynamic Bayesian networks provide a compact and natural representation for complex dynamic systems. However, in many cases, there is no expert available from whom a model can be elicited. Learning provides an alternative approach for constructing models of dynamic systems. In this paper, we address some of the crucial computational aspects of learning the structure of dynamic systems, particularly those where some relevant variables are partially observed or even entirely unknown. Our approach is based on the Structural Expectation Maximization (SEM) algorithm. The main computational cost of the SEM algorithm is the gathering of expected sufficient statistics. We propose a novel approximation scheme that allows these sufficient statistics to be computed efficiently. We also investigate the fundamental problem of discovering the existence of hidden variables without exhaustive and expensive search. Our approach is based on the observation that, in dynamic systems, ignoring a hidden variable typically results in a violation of the Markov property. Thus, our algorithm searches for such violations in the data, and introduces hidden variables to explain them. We provide empirical results showing that the algorithm is able to learn the dynamics of complex systems in a computationally tractable way.