License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-13792
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1379/
Zettlemoyer, Luke S. ; Pasula, Hanna M. ; Pack Kaelbling, Leslie

Logical Particle Filtering

pdf-format:
Dokument 1.pdf (238 KB)

Abstract

In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical particle filtering algorithm. Each particle contains a logical formula that describes a set of states. The algorithm updates the formulae as new observations are received. Since a single particle tracks many states, this filter can be more accurate than a traditional particle filter in high dimensional state spaces, as we demonstrate in experiments.

BibTeX - Entry

@InProceedings{zettlemoyer_et_al:DSP:2008:1379,
  author =	{Luke S. Zettlemoyer and Hanna M. Pasula and Leslie Pack Kaelbling},
  title =	{Logical Particle Filtering},
  booktitle =	{Probabilistic, Logical and Relational Learning - A Further Synthesis},
  year =	{2008},
  editor =	{Luc de Raedt and Thomas Dietterich and Lise Getoor and Kristian Kersting and Stephen H. Muggleton},
  number =	{07161},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1379},
  annote =	{Keywords: Particle filter, logical hidden Markov model}
}

Keywords: Particle filter, logical hidden Markov model
Seminar: 07161 - Probabilistic, Logical and Relational Learning - A Further Synthesis
Issue date: 2008
Date of publication: 06.03.2008

DROPS-Home | Fulltext Search | Imprint Published by LZI