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. © 2012 Springer-Verlag.
CITATION STYLE
Finthammer, M. (2012). An iterative scaling algorithm for maximum entropy reasoning in relational probabilistic conditional logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7520 LNAI, pp. 351–364). https://doi.org/10.1007/978-3-642-33362-0_27
Mendeley helps you to discover research relevant for your work.