信度网络关于节点目标排序的最小I-映射
Deriving a Minimal I-map of a Belief Network Relative to a Target Ordering of its Nodes
摘要:
本文提出并解决了一个新的优化问题:给定一个信念网络(BN)及其变量的目标排序,如何有效地导出其弧与目标排序一致的最小I-map?我们提出了这个问题的三种解决方案,所有这些都导致基于原始BN的递归基相对于指定的排序的有向无环图(这样的DAG有时被称为从给定BN相对于所述排序绘制的边界DAG [5])。一路上,我们还发现了关于弧反转的一个重要的一般原则:当根据某些目标排序对BN进行重新排序时(同时尝试最小化生成的弧的数量),弧反转的序列应该遵循由原始信念引起的拓扑排序网络的弧尽可能大的程度。这些结果有望对共识模型的推导以及其他需要重新配置和/或组合BN的算法产生重大影响。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。