Skip to main navigation Skip to search Skip to main content

Abstract

The lifted dynamic junction tree algorithm (LDJT) efficiently answers exact filtering and prediction queries for probabilistic relational temporal models by building and then reusing a first-order cluster representation of a knowledge base for multiple queries and time steps. We extend the underling model of LDJT to provide means to calculate a lifted temporal solution to the maximum expected utility problem. © CEUR-WS. All rights reserved.
Original languageEnglish
Title of host publication1st Joint Workshop on AI in Health
Number of pages4
Volume2142
PublisherCEUR-WS.org
Publication date01.07.2018
Pages93-96
Publication statusPublished - 01.07.2018
Event1st Joint Workshop on AI in Health - Stockholm, Sweden
Duration: 13.07.201814.07.2018
Conference number: 138105

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 3 - Good Health and Well-being
    SDG 3 Good Health and Well-being
  2. SDG 8 - Decent Work and Economic Growth
    SDG 8 Decent Work and Economic Growth
  3. SDG 9 - Industry, Innovation, and Infrastructure
    SDG 9 Industry, Innovation, and Infrastructure

DFG Research Classification Scheme

  • 4.43-01 Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Towards lifted maximum expected utility'. Together they form a unique fingerprint.

Cite this