Deriving a Minimal I-map of a Belief Network Relative to a Target Ordering of its Nodes

03/06/2013
by   Izhar Matzkevich, et al.
0

This paper identifies and solves a new optimization problem: Given a belief network (BN) and a target ordering on its variables, how can we efficiently derive its minimal I-map whose arcs are consistent with the target ordering? We present three solutions to this problem, all of which lead to directed acyclic graphs based on the original BN's recursive basis relative to the specified ordering (such a DAG is sometimes termed the boundary DAG drawn from the given BN relative to the said ordering [5]). Along the way, we also uncover an important general principal about arc reversals: when reordering a BN according to some target ordering, (while attempting to minimize the number of arcs generated), the sequence of arc reversals should follow the topological ordering induced by the original belief network's arcs to as great an extent as possible. These results promise to have a significant impact on the derivation of consensus models, as well as on other algorithms that require the reconfiguration and/or combination of BN's.

READ FULL TEXT
research
02/15/2022

The directed plump ordering

Based on Taylor's hereditarily directed plump ordinals, we define the di...
research
02/14/2019

Estimation of Gaussian directed acyclic graphs using partial ordering information with an application to dairy cattle data

Estimating a directed acyclic graph (DAG) from observational data repres...
research
01/10/2011

Finding Consensus Bayesian Network Structures

Suppose that multiple experts (or learning algorithms) provide us with a...
research
03/23/2018

2CoBel : An Efficient Belief Function Extension for Two-dimensional Continuous Spaces

This paper introduces an innovative approach for handling 2D compound hy...
research
08/27/2012

New results of ant algorithms for the Linear Ordering Problem

Ant-based algorithms are successful tools for solving complex problems. ...
research
08/27/2022

Consistency between ordering and clustering methods for graphs

A relational dataset is often analyzed by optimally assigning a label to...
research
09/09/2019

Does Order Matter? An Empirical Study on Generating Multiple Keyphrases as a Sequence

Recently, concatenating multiple keyphrases as a target sequence has bee...

Please sign up or login with your details

Forgot password? Click here to reset