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 language | English |
---|---|
Title of host publication | 1st Joint Workshop on AI in Health |
Number of pages | 4 |
Volume | 2142 |
Publisher | CEUR-WS.org |
Publication date | 01.07.2018 |
Pages | 93-96 |
Publication status | Published - 01.07.2018 |
Event | 1st Joint Workshop on AI in Health - Stockholm, Sweden Duration: 13.07.2018 → 14.07.2018 Conference number: 138105 |
DFG Research Classification Scheme
- 4.43-01 Theoretical Computer Science