On a simple method for testing independencies in Bayesian networks. (18th July 2017)

• Record Type: Journal Article
• Authors: Butz, Cory J.; dos Santos, André E.; Oliveira, Jhonatan S.; Gonzales, Christophe
• Is Part Of: Computational intelligence. Volume 34:Number 3(2018)
• Page Start: 789
• Page End: 801
• Publication Date: 2017-07-18
• Subjects: Bayesian networks -- d‐separation -- m‐separation -- testing independencies; Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12130
• Languages: English
• ISSNs: 0824-7935

Abstract

Abstract: Testing independencies is a fundamental task in reasoning with Bayesian networks (BNs). In practice, d‐separation is often used for this task, since it has linear‐time complexity. However, many have had difficulties understanding d‐separation in BNs. An equivalent method that is easier to understand, called m‐separation, transforms the problem from directed separation in BNs into classical separation in undirected graphs. Two main steps of this transformation are pruning the BN and adding undirected edges. In this paper, we propose u‐separation as an even simpler method for testing independencies in a BN. Our approach also converts the problem into classical separation in an undirected graph. However, our method is based upon the novel concepts of inaugural variables and rationalization. Thereby, the primary advantage of u‐separation over m‐separation is that m‐separation can prune unnecessarily and add superfluous edges. Our experiment results show that u‐separation performs 73% fewer modifications on average than m‐separation.