Approximate Bayesian Learning of Partition Directed Acyclic Graphs
Partition directed acyclic graphs (PDAGs) is a model whereby the conditional probability tables (CPTs) are partitioned into parts with equal probability. In this way, the number of parameters that need to be learned can be significantly reduced so that some problems become more computationally feasi...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Matematisk statistik
2016
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-192853 |