Properties of Bayesian Belief Network Learning Algorithms

UAI 1994 pp. 102-109

doi:10.1016/B978-1-55860-332-5.50018-3 /uai/1994/bouckaert1994uai-properties/

Abstract

In this paper the behavior of various belief network learning algorithms is studied. Selecting belief networks with certain minimallity properties turns out to be NP-hard, which justifies the use of search heuristics. Search heuristics based on the Bayesian measure of Cooper and Herskovits and a minimum description length (MDL) measure are compared with respect to their properties for both limiting and finite database sizes. It is shown that the MDL measure has more desirable properties than the Bayesian measure. Experimental results suggest that for learning probabilities of belief networks smoothing is helpful.

PDF UAI Semantic Scholar

Cite

Text

Bouckaert. "Properties of Bayesian Belief Network Learning Algorithms." Conference on Uncertainty in Artificial Intelligence, 1994. doi:10.1016/B978-1-55860-332-5.50018-3

Markdown

[Bouckaert. "Properties of Bayesian Belief Network Learning Algorithms." Conference on Uncertainty in Artificial Intelligence, 1994.](https://mlanthology.org/uai/1994/bouckaert1994uai-properties/) doi:10.1016/B978-1-55860-332-5.50018-3

BibTeX

@inproceedings{bouckaert1994uai-properties,
  title     = {{Properties of Bayesian Belief Network Learning Algorithms}},
  author    = {Bouckaert, Remco R.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1994},
  pages     = {102-109},
  doi       = {10.1016/B978-1-55860-332-5.50018-3},
  url       = {https://mlanthology.org/uai/1994/bouckaert1994uai-properties/}
}