- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- A clique tree algorithm exploiting context specific...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
A clique tree algorithm exploiting context specific independence Tung, Leslie
Abstract
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 algorithm is based on a query-based contextual variable elimination algorithm (eve) that eliminates in turn the variables not needed in an answer. We extend eve to producing the posterior probabilities of all variables efficiently and allow the incremental addition of evidence. We perform experiments that compare eve-tree and Hugin using parameterized random networks that exhibit various amounts of context specific independence, as well as a standard network, the Insurance network. Our empirical results show that eve-tree is efficient, both in time and in space, as compared to the Hugin architecture, on computing posterior probabilities for Bayesian networks that exhibit context specific independence.
Item Metadata
Title |
A clique tree algorithm exploiting context specific independence
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2002
|
Description |
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 algorithm is based on a query-based
contextual variable elimination algorithm (eve) that eliminates in turn the variables
not needed in an answer. We extend eve to producing the posterior probabilities
of all variables efficiently and allow the incremental addition of evidence. We perform
experiments that compare eve-tree and Hugin using parameterized random
networks that exhibit various amounts of context specific independence, as well as a
standard network, the Insurance network. Our empirical results show that eve-tree
is efficient, both in time and in space, as compared to the Hugin architecture, on
computing posterior probabilities for Bayesian networks that exhibit context specific
independence.
|
Extent |
3086713 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-09-28
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0051389
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2002-11
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.