Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence Classes
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.
Unable to display preview. Download preview PDF.
- 2.Buntine, W.: Theory refinement on Bayesian networks. In: UAI 1991, pp. 52–60. Morgan Kaufmann Publishers Inc., San Francisco (1991)Google Scholar
- 4.Chickering, D.M., Geiger, D., Heckerman, D.: Learning Bayesian networks: Search methods and experimental results. In: Proc. AISTATS 1995, pp. 112–128 (1995)Google Scholar
- 5.Friedman, N., Nachman, I., Pe’er, D.: Learning Bayesian network structure from massive datasets: The ”Sparse Candidate” algorithm. In: UAI 1999, pp. 206–215 (1999)Google Scholar
- 6.Gámez, J.A., Mateo, J.L., Puerta, J.M.: Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood. Data Min. Knowl. Disc. (2010), doi:10.1007/s10618–010–0178–6 (to appear)Google Scholar
- 8.Neapolitan, R.: Learning Bayesian Networks. Prentice-Hall, Englewood Cliffs (2003)Google Scholar