NAT model–based compression of Bayesian network CPTs over multivalued variables. (18th July 2017)

• Record Type: Journal Article
• Authors: Xiang, Yang; Jiang, Qian
• Is Part Of: Computational intelligence. Volume 34:Number 1(2018)
• Page Start: 219
• Page End: 240
• Publication Date: 2017-07-18
• Subjects: Bayesian networks -- causal independence models -- knowledge representation; Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12126
• Languages: English
• ISSNs: 0824-7935

Abstract

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.