Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence relations that cannot be captured in a Bayesian network structure, and can sometimes provide computationally more efficient representations than Bayesian networks. In this paper we present an algorithm for learning PDGs from data. First experiments show that the algorithm is capable of learning optimal PDG representations in some cases, and that the computational efficiency of PDG models learned from real-life data is very close to the computational efficiency of Bayesian network models.
|Titel||Proceedings of the Second European Workshop on Probabilistic Graphical Models|
|Status||Udgivet - 2004|
|Begivenhed||PGM´04 - Leiden, Holland|
Varighed: 4 sep. 2004 → 8 sep. 2004
Konferencens nummer: 2
|Periode||04/09/2004 → 08/09/2004|