Enumerating unlabeled and root labeled trees for causal model acquisition

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs to be assessed for each node. It generally has the complexity exponential on n. The non-impeding noisy-AND (NIN-AND) tree is a recently developed causal model that reduces the complexity to linear, while modeling both reinforcing and undermining interactions among causes. Acquisition of an NIN-AND tree model involves elicitation of a linear number of probability parameters and a tree structure. Instead of asking the human expert to describe the structure from scratch, in this work, we develop a two-step menu selection technique that aids structure acquisition. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Xiang, Y., Zhu, Z. J., & Li, Y. (2009). Enumerating unlabeled and root labeled trees for causal model acquisition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5549 LNAI, pp. 158–170). https://doi.org/10.1007/978-3-642-01818-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free