|
|
|
|
Inference with Seperately Specified Sets of Probabilities in Credal Networks
Jose Ferreira da Rocha, Fabio Cozman
Abstract:
We present new algorithms for inference in credal networks --- directed acyclic graphs associated with sets of probabilities. Credal networks are here interpreted as encoding strong independence relations among variables. We first present a theory of credal networks based on separately specified sets of probabilities. We also show that inference with polytrees is NP-hard in this setting. We then introduce new techniques that reduce the computational effort demanded by inference, particularly in polytrees, by exploring separability of credal sets.
Keywords:
Pages: 430-437
PS Link:
PDF Link: /papers/02/p430-ferreira_da_rocha.pdf
BibTex:
@INPROCEEDINGS{Ferreira da Rocha02,
AUTHOR = "Jose Ferreira da Rocha
and Fabio Cozman",
TITLE = "Inference with Seperately Specified Sets of Probabilities in Credal Networks",
BOOKTITLE = "Proceedings of the Eighteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-02)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "2002",
PAGES = "430--437"
}
|
|
