English
资源说明：Suppose that multiple experts (or learning algorithms) provide us with alternative
Bayesian network (BN) structures over a domain, and that we are interested in combining
them into a single consensus BN structure. Specically, we are interested in that the
consensus BN structure only represents independences all the given BN structures agree
upon and that it has as few parameters associated as possible. In this paper, we prove
that there may exist several non-equivalent consensus BN structures and that nding one
of them is NP-hard. Thus, we decide to resort to heuristics to nd an approximated
consensus BN structure. In this paper, we consider the heuristic proposed by Matzkevich
and Abramson, which builds upon two algorithms, called Methods A and B, for eciently
deriving the minimal directed independence map of a BN structure relative to a given node
ordering. Methods A and B are claimed to be correct although no proof is provided (a
proof is just sketched). In this paper, we show that Methods A and B are not correct and
propose a correction of them.
本源码包内暂不包含可直接显示的源代码文件，请下载源码包。
