期刊
出版社
JMLR-JOURNAL MACHINE LEARNING RESEARCH
关键词
Probabilistic graphical models; credal networks; Bayesian networks; variable elimination; convex hull; imprecise probability
The paper introduces a Java library called CREMA for modeling, processing, and querying credal networks. Despite the NP-hardness of exact credal network inferences, there are many approximate algorithms available. CREPO is an open repository that provides synthetic credal networks and the exact results of inference tasks on these models.
Credal networks are a popular class of imprecise probabilistic graphical models obtained as a Bayesian network generalization based on, so-called credal, sets of probability mass functions. A Java library called CREMA has been recently released to model, process and query credal networks. Despite the NP-hardness of the (exact) task, a number of algorithms is available to approximate credal network inferences. In this paper we present CREPO, an open repository of synthetic credal networks, provided together with the exact results of inference tasks on these models. A Python tool is also delivered to load these data and interact with CREMA, thus making extremely easy to evaluate and compare existing and novel inference algorithms. To demonstrate such benchmarking scheme, we propose an approximate heuristic to be used inside variable elimination schemes to keep a bound on the maximum number of vertices generated during the combination step. A CREPO-based validation against approximate procedures based on linearization and exact techniques performed in CREMA is finally discussed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据