Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes

Authors:
Juan I. Alonso-Barba;Luis De La Ossa;Jose A. Gámez;Jose M. Puerta
Affiliations:
Department of Computing Systems, Intelligent Systems and Data Mining Lab, Albacete Research Institute of Informatics, University of Castilla-La Mancha, Albacete, Spain;Department of Computing Systems, Intelligent Systems and Data Mining Lab, Albacete Research Institute of Informatics, University of Castilla-La Mancha, Albacete, Spain;Department of Computing Systems, Intelligent Systems and Data Mining Lab, Albacete Research Institute of Informatics, University of Castilla-La Mancha, Albacete, Spain;Department of Computing Systems, Intelligent Systems and Data Mining Lab, Albacete Research Institute of Informatics, University of Castilla-La Mancha, Albacete, Spain
Venue:
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Year:
2011

Citing 8
Cited 1

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Theory refinement on Bayesian networks

Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
Optimal structure identification with greedy search

The Journal of Machine Learning Research
The max-min hill-climbing Bayesian network structure learning algorithm

Machine Learning
Learning Bayesian Networks

Learning Bayesian Networks
Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood

Data Mining and Knowledge Discovery
Learning bayesian network structure from massive datasets: the «sparse candidate« algorithm

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Scaling up the Greedy Equivalence Search algorithm by constraining the search space of equivalence classes

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Greedy Equivalence Search (GES) is nowadays the state of the art algorithm for learning Bayesian networks (BNs) from complete data. However, from a practical point of view, this algorithm may not be fast enough to work in high dimensionality domains. This paper proposes some variants of GES aimed to increase its efficiency. Under faithfulness assumption, the modified algorithms preserve the same theoretical properties as the original one, that is, they recover a perfect map of the target distribution in the large sample limit. Moreover, experimental results confirm that, although they carry out much less computations, BNs learnt by those algorithms have the same quality as those learnt by GES.