Article: Bound Propagation

JAIR is pleased to announce the publication of the following article:

Leisink, M. and Kappen, B. (2003)
  "Bound Propagation", 
   Volume 19, pages 139-154.

   For quick access via your WWW browser, use this URL:
     http://www.jair.org/abstracts/leisink03a.html

Abstract:
In this article we present an algorithm to compute bounds on the
marginals of a graphical model.  For several small clusters of nodes upper
and lower bounds on the marginal values are computed independently of
the rest of the network.  The range of allowed probability distributions
over the surrounding nodes is restricted using earlier computed bounds.
As we will show, this can be considered as a set of constraints in
a linear programming problem of which the objective function is the
marginal probability of the center nodes.  In this way knowledge about
the maginals of neighbouring clusters is passed to other clusters thereby
tightening the bounds on their marginals.  We show that sharp bounds
can be obtained for undirected and directed graphs that are used for
practical applications, but for which exact computations are
infeasible. 

The article is available via:
   
 -- comp.ai.jair.papers (also see comp.ai.jair.announce)

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.jair.org/
    For direct access to this article and related files try:
       http://www.jair.org/abstracts/leisink03a.html

 -- Anonymous FTP from Carnegie-Mellon University (USA):
        ftp://ftp.cs.cmu.edu/project/jair/volume19/leisink03a.ps
    The compressed PostScript file is named leisink03a.ps.Z 

For more information about JAIR, visit our WWW or FTP sites, or
contact [EMAIL PROTECTED]



-- 
Steven Minton
JAIR Managing Editor