Dynamic MMHC: A Local Search Algorithm for Dynamic Bayesian Network Structure Learning
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 392-403
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Benchmarking dynamic Bayesian network structure learning algorithms2013
- Learning Bayesian networks: approaches and issuesThe Knowledge Engineering Review, 2011
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhoodData Mining and Knowledge Discovery, 2010
- A Novel Scalable and Data Efficient Feature Subset Selection AlgorithmLecture Notes in Computer Science, 2008
- Learning Dynamic Bayesian Networks Structure Based on Bayesian Optimization Algorithm2007
- The max-min hill-climbing Bayesian network structure learning algorithmMachine Learning, 2006
- Learning Bayesian Networks Does Not Have to Be NP-Hard2006
- Scalable, Efficient and Correct Learning of Markov Boundaries Under the Faithfulness Assumption2005
- Time and sample efficient discovery of Markov blankets and direct causal relations2003
- Evolutionary learning of dynamic probabilistic models with large time lagsInternational Journal of Intelligent Systems, 2001