arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.1472cs.AI
收藏

信度网络组合中的复杂性问题

Some Complexity Considerations in the Combination of Belief Networks

University of Southern California(南加州大学)

Izhar Matzkevich, Bruce Abramson

摘要:

在知识库系统研究界,一个可能引起越来越多注意的主题是协调多位专家提供的信息。我们设想的情况下,几个专家独立编码的信息作为信念网络。然后,潜在的用户必须协调这些网络的结论和建议,以取得某种共识。达成这种共识的一种方法是在考虑任何案例特定数据(特定观察,测试结果)之前,将贡献的网络融合到单个共识模型中。这种方法需要两种类型的组合过程,一种用于概率,一种用于图。由于概率的组合是相对好理解的,这种方法的关键障碍在于图论领域。本文提供了一些必要的操作,以实现必要的图形组合的正式定义,并提供了这些程序的复杂性分析。本文的主要结果是,这些操作大多数是NP难的,其主要信息是,推导?好吗?共识网络必须以经验主义的方式进行。

英文摘要:

One topic that is likely to attract an increasing amount of attention within the Knowledge-base systems research community is the coordination of information provided by multiple experts. We envision a situation in which several experts independently encode information as belief networks. A potential user must then coordinate the conclusions and recommendations of these networks to derive some sort of consensus. One approach to such a consensus is the fusion of the contributed networks into a single, consensus model prior to the consideration of any case-specific data (specific observations, test results). This approach requires two types of combination procedures, one for probabilities, and one for graphs. Since the combination of probabilities is relatively well understood, the key barriers to this approach lie in the realm of graph theory. This paper provides formal definitions of some of the operations necessary to effect the necessary graphical combinations, and provides complexity analyses of these procedures. The paper's key result is that most of these operations are NP-hard, and its primary message is that the derivation of ?good? consensus networks must be done heuristically.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑