Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

NAT model–based compression of Bayesian network CPTs over multivalued variables

NAT model–based compression of Bayesian network CPTs over multivalued variables Nonimpeding noisy‐AND tree (NAT) models offer a highly expressive approximate representation for significantly reducing the space of Bayesian networks (BNs). They also improve efficiency of BN inference significantly. To enable these advantages for general BNs, several technical advancements are made in this work to compress target BN conditional probability tables (CPTs) over multivalued variables into NAT models. We extend the semantics of NAT models beyond graded variables that causal independence models commonly adhered to and allow NAT modeling in nominal causal variables. We overcome the limitation of well‐defined pairwise causal interaction (PCI) bits and present a flexible PCI pattern extraction from target CPTs. We extend parameter estimation for binary NAT models to constrained gradient descent for compressing target CPTs over multivalued variables. We reveal challenges associated with persistent leaky causes and develop a novel framework for PCI pattern extraction when persistent leaky causes exist. The effectiveness of the CPT compression is validated experimentally. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computational Intelligence Wiley

NAT model–based compression of Bayesian network CPTs over multivalued variables

Computational Intelligence , Volume 34 (1) – Jan 1, 2018

Loading next page...
1
 
/lp/wiley/nat-model-based-compression-of-bayesian-network-cpts-over-multivalued-XC403kj50m

References (23)

Publisher
Wiley
Copyright
© 2018 Wiley Periodicals, Inc.
ISSN
0824-7935
eISSN
1467-8640
DOI
10.1111/coin.12126
Publisher site
See Article on Publisher Site

Abstract

Nonimpeding noisy‐AND tree (NAT) models offer a highly expressive approximate representation for significantly reducing the space of Bayesian networks (BNs). They also improve efficiency of BN inference significantly. To enable these advantages for general BNs, several technical advancements are made in this work to compress target BN conditional probability tables (CPTs) over multivalued variables into NAT models. We extend the semantics of NAT models beyond graded variables that causal independence models commonly adhered to and allow NAT modeling in nominal causal variables. We overcome the limitation of well‐defined pairwise causal interaction (PCI) bits and present a flexible PCI pattern extraction from target CPTs. We extend parameter estimation for binary NAT models to constrained gradient descent for compressing target CPTs over multivalued variables. We reveal challenges associated with persistent leaky causes and develop a novel framework for PCI pattern extraction when persistent leaky causes exist. The effectiveness of the CPT compression is validated experimentally.

Journal

Computational IntelligenceWiley

Published: Jan 1, 2018

Keywords: ; ;

There are no references for this article.