A clique tree algorithm exploiting context specific independence
Context specific independence can provide compact representation of the conditional probabilities in Bayesian networks when some variables are only relevant in specific contexts. We present eve-tree, an algorithm that exploits context specific independence in clique tree propagation. This algorit...
Main Author: | Tung, Leslie |
---|---|
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/13264 |
Similar Items
-
A clique tree algorithm exploiting context specific independence
by: Tung, Leslie
Published: (2009) -
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
by: Chuan-Min Lee
Published: (2021-01-01) -
Cliques and independent sets
by: Haviland, Julie Sarah
Published: (1989) -
Computing a Clique Tree with the Algorithm Maximal Label Search
by: Anne Berry, et al.
Published: (2017-01-01) -
Temporal interval cliques and independent sets
by: Hermelin, D., et al.
Published: (2023)