The complexity of plate probabilistic models

Fabio G. Cozman, Denis D. Mauá

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

© Springer International Publishing Switzerland 2015. Plate-based probabilistic models combine a few relational constructs with Bayesian networks, so as to allow one to specify large and repetitive probabilistic networks in a compact and intuitive manner. In this paper we investigate the combined, data and domain complexity of plate models, showing that they range from polynomial to #P-complete to #EXP-complete.
Original languageAmerican English
Title of host publicationThe complexity of plate probabilistic models
Pages36-49
Number of pages14
ISBN (Electronic)9783319235394
DOIs
StatePublished - 1 Jan 2015
Externally publishedYes
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2018 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9310
ISSN (Print)0302-9743

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/18 → …

Fingerprint Dive into the research topics of 'The complexity of plate probabilistic models'. Together they form a unique fingerprint.

Cite this