EM Algorithm for Symmetric Causal Independence Models
Abstract
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this paper, we present the EM algorithm to learn the parameters in causal independence models based on the symmetric Boolean function. The developed algorithm enables us to assess the practical usefulness of the symmetric causal independence models, which has not been done previously. We evaluate the classification performance of the symmetric causal independence models learned with the presented EM algorithm. The results show the competitive performance of these models in comparison to noisy OR and noisy AND models as well as other state-of-the-art classifiers.
Cite
Text
Jurgelenaite and Heskes. "EM Algorithm for Symmetric Causal Independence Models." European Conference on Machine Learning, 2006. doi:10.1007/11871842_25Markdown
[Jurgelenaite and Heskes. "EM Algorithm for Symmetric Causal Independence Models." European Conference on Machine Learning, 2006.](https://mlanthology.org/ecmlpkdd/2006/jurgelenaite2006ecml-em/) doi:10.1007/11871842_25BibTeX
@inproceedings{jurgelenaite2006ecml-em,
title = {{EM Algorithm for Symmetric Causal Independence Models}},
author = {Jurgelenaite, Rasa and Heskes, Tom},
booktitle = {European Conference on Machine Learning},
year = {2006},
pages = {234-245},
doi = {10.1007/11871842_25},
url = {https://mlanthology.org/ecmlpkdd/2006/jurgelenaite2006ecml-em/}
}