Lifted Maximum Expected Utility

Marcel Gehrke, Tanya Braun, Ralf Möller, Alexander Waschkau, Christoph Strumann, Jost Steinhäuser

Abstract

The lifted junction tree algorithm (LJT) answers multiple queries efficiently for relational models under uncertainties by building and then reusing a first-order cluster representation. We extend the underling model representation of LJT, which is called parameterised probabilistic model, to calculate a lifted solution to the maximum expected utility (MEU) problem. Specifically, this paper contributes (i) action and utility nodes for parameterised probabilistic models, resulting in parameterised probabilistic decision models and (ii) meuLJT, an algorithm to solve the MEU problem using parameterised probabilistic decision models efficiently, while also being able to answer multiple marginal queries.
Original languageEnglish
Title of host publicationArtificial Intelligence in Health
EditorsFernando Koch, Andrew Koster, David Riaño, Sara Montagna, Michael Schumacher, Annette ten Teije, Christian Guttmann, Manfred Reichert, Isabelle Bichindaritz, Pau Herrero, Richard Lenz, Beatriz López, Cindy Marling, Clare Martin, Stefania Montani, Nirmalie Wiratunga
Number of pages11
Place of PublicationCham
PublisherSpringer International Publishing
Publication date2019
Pages131-141
ISBN (Print)978-3-030-12738-1
Publication statusPublished - 2019

Fingerprint

Dive into the research topics of 'Lifted Maximum Expected Utility'. Together they form a unique fingerprint.

Cite this