Published November 2008 | Version public
Journal Article

Mixed deterministic and probabilistic networks

  • 1. ROR icon California Institute of Technology
  • 2. ROR icon University of California, Irvine

Abstract

The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to develop mixed networks stems from the desire to fully exploit the deterministic information (constraints) that is often present in graphical models. Several concepts and algorithms specific to belief networks and constraint networks are combined, achieving computational efficiency, semantic coherence and user-interface convenience. We define the semantics and graphical representation of mixed networks, and discuss the two main types of algorithms for processing them: inference-based and search-based. A preliminary experimental evaluation shows the benefits of the new model.

Additional Information

© 2009 Springer Science + Business Media B.V. Received: 19 March 2009. Accepted: 19 March 2009. Published online: 25 April 2009. This work was supported in part by the NSF grant IIS-0713118 and by the NIH grant R01-HG004175-02.

Additional details

Identifiers

Eprint ID
16121
DOI
10.1007/s10472-009-9132-y
Resolver ID
CaltechAUTHORS:20090929-151329294

Related works

Funding

NSF
IIS-0713118
NIH
R01-HG004175-02

Dates

Created
2009-10-09
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field