首页> 外文会议>International Conference on Scalable Uncertainty Management >An Iterative Scaling Algorithm for Maximum Entropy Reasoning in Relational Probabilistic Conditional Logic
【24h】

An Iterative Scaling Algorithm for Maximum Entropy Reasoning in Relational Probabilistic Conditional Logic

机译:用于关系概率条件逻辑的最大熵推理的迭代缩放算法

获取原文

摘要

Recently, different semantics for relational probabilistic conditionals and corresponding maximum entropy (ME) inference operators have been proposed. In this paper, we study the so-called aggregation semantics that covers both notions of a statistical and subjective view. The computation of its inference operator requires the calculation of the ME-distribution satisfying all probabilistic conditionals, inducing an optimization problem under linear constraints. We demonstrate how the well-known Generalized Iterative Scaling (GIS) algorithm technique can be applied to this optimization problem and present a practical algorithm and its implementation.
机译:最近,已经提出了针对关系概率条件和相应的最大熵(ME)推理运算符的不同语义。在本文中,我们研究所谓的聚合语义,涵盖统计和主观视图的两个概念。其推理操作员的计算需要计算满足所有概率条件的ME分配,在线性约束下引起优化问题。我们展示了众所周知的广义迭代缩放(GIS)算法技术如何应用​​于该优化问题并呈现实用的算法及其实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号