Factorization, inference and parameter learning in discrete AMP chain graphs
From MaRDI portal
Abstract: We address some computational issues that may hinder the use of AMP chain graphs in practice. Specifically, we show how a discrete probability distribution that satisfies all the independencies represented by an AMP chain graph factorizes according to it. We show how this factorization makes it possible to perform inference and parameter learning efficiently, by adapting existing algorithms for Markov and Bayesian networks. Finally, we turn our attention to another issue that may hinder the use of AMP CGs, namely the lack of an intuitive interpretation of their edges. We provide one such interpretation.
Recommendations
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Learning marginal AMP chain graphs under faithfulness
- Learning marginal AMP chain graphs under faithfulness revisited
- Characterizing Markov equivalence classes for AMP chain graph models
- AMP chain graphs: minimal separators and structure learning algorithms
Cites work
- Alternative Markov properties for chain graphs
- Chain graph interpretations and their relations revisited
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Machine learning. A probabilistic perspective
- Marginal AMP chain graphs
- On expressiveness of the AMP chain graph interpretation
- Probabilistic graphical models.
- Probabilistic Networks and Expert Systems
Cited in
(3)
This page was built for publication: Factorization, inference and parameter learning in discrete AMP chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451191)