On the use of local search heuristics to improve GES-based Bayesian network learning
Authors:
- Juan I. AlonsoJAJuan I. Alonso
- Luis de la OssaLOLuis de la Ossa
- José A. GámezJGJosé A. Gámez
- José M. PuertaJPJosé M. Puerta
- 1 March 2018
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 64, 366-376
Abstract
No abstract availableKeywords
Funding Information
- European Regional Development Fund
- Spanish Government (TIN2013-46638-C3-3-P, TIN2016-77902-C3-1-P)
This publication has 21 references indexed in Scilit:
- Learning Bayesian networks: approaches and issuesThe Knowledge Engineering Review, 2011
- Structural learning of Bayesian networks using local algorithms based on the space of orderingsSoft Computing, 2010
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhoodData Mining and Knowledge Discovery, 2010
- The max-min hill-climbing Bayesian network structure learning algorithmMachine Learning, 2006
- An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence testsInternational Journal of Intelligent Systems, 2003
- A characterization of Markov equivalence classes for acyclic digraphsThe Annals of Statistics, 1997
- Learning Bayesian networks: The combination of knowledge and statistical dataMachine Learning, 1995
- LEARNING BAYESIAN BELIEF NETWORKS: AN APPROACH BASED ON THE MDL PRINCIPLEComputational Intelligence, 1994
- A Bayesian method for the induction of probabilistic networks from dataMachine Learning, 1992
- A Comparison of Alternative Tests of Significance for the Problem of $m$ RankingsThe Annals of Mathematical Statistics, 1940