Benchmarking dynamic Bayesian network structure learning algorithms
- 1 April 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 50, 1-6
Abstract
Dynamic Bayesian Networks (DBNs) are probabilistic graphical models dedicated to model multivariate time series. Two-time slice BNs (2-TBNs) are the most current type of these models. Static BN structure learning is a well-studied domain. Many approaches have been proposed and the quality of these algorithms has been studied over a range of different standard networks and methods of evaluation. To the best of our knowledge, all studies about DBN structure learning use their own benchmarks and techniques for evaluation. The problem in the dynamic case is that we don't find previous works that provide details about used networks and indicators of comparison. In addition, access to the datasets and the source code is not always possible. In this paper, we propose a novel approach to generate standard DBNs based on tiling and novel technique of evaluation, adapted from the "static" Structural Hamming Distance proposed for Bayesian networks.Keywords
This publication has 13 references indexed in Scilit:
- An Experimental Comparison of Hybrid Algorithms for Bayesian Network Structure LearningLecture Notes in Computer Science, 2012
- Learning Bayesian networks: approaches and issuesThe Knowledge Engineering Review, 2011
- Bayesian network learning algorithms using structural restrictionsInternational Journal of Approximate Reasoning, 2007
- Time and sample efficient discovery of Markov blankets and direct causal relations2003
- Scalable Techniques for Mining Causal StructuresData Mining and Knowledge Discovery, 2000
- 10.1162/153244302760200696Applied Physics Letters, 2000
- Comprehensive Identification of Cell Cycle–regulated Genes of the YeastSaccharomyces cerevisiaeby Microarray HybridizationMolecular Biology of the Cell, 1998
- Learning Bayesian networks: The combination of knowledge and statistical dataMachine Learning, 1995
- A Bayesian method for the induction of probabilistic networks from dataMachine Learning, 1992
- Approximating discrete probability distributions with dependence treesIEEE Transactions on Information Theory, 1968