Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!europa.eng.gtefsd.com!news.umbc.edu!haven.umd.edu!ames!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, Learning with Graphical Models
Message-ID: <1994Dec20.220529.20461@ptolemy-ethernet.arc.nasa.gov>
Originator: jair-ed@polya.arc.nasa.gov
Lines: 61
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Tue, 20 Dec 1994 22:05:29 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

JAIR is pleased to announce publication of the following article:

Buntine, W.L. (1994)
  "Operations for Learning with Graphical Models", Volume 2, pages 159-225
   Postscript: volume2/buntine94a.ps (1.53M)
               compressed, volume2/buntine94a.ps.Z (568K)

  Abstract: This paper is a multidisciplinary review of empirical,
  statistical learning from a graphical model perspective.  Well-known
  examples of graphical models include Bayesian networks, directed
  graphs representing a Markov chain, and undirected networks
  representing a Markov field.  These graphical models are extended to
  model data analysis and empirical learning using the notation of
  plates.  Graphical operations for simplifying and manipulating a
  problem are provided including decomposition, differentiation, and the
  manipulation of probability models from the exponential family.  Two
  standard algorithm schemas for learning are reviewed in a graphical
  framework: Gibbs sampling and the expectation maximization algorithm.
  Using these operations and schemas, some popular algorithms can be
  synthesized from their graphical specification.  This includes
  versions of linear regression, techniques for feed-forward networks,
  and learning Gaussian and discrete Bayesian networks from data.  The
  paper concludes by sketching some implications for data analysis and
  summarizing how some popular algorithms fall within the framework
  presented.
  
  The main original contributions here are the decomposition techniques
  and the demonstration that graphical models provide a framework for
  understanding and developing complex learning algorithms.


The PostScript file is available via:
   
 -- comp.ai.jair.papers

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html

 -- Anonymous FTP from either of the two sites below:
      CMU:   p.gp.cs.cmu.edu        directory: /usr/jair/pub/volume2
      Genoa: ftp.mrg.dist.unige.it  directory:  pub/jair/pub/volume2

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND, and the body GET VOLUME2/BUNTINE94A.PS
    (either upper or lowercase is fine). 
    Note: Your mailer might find this file too large to handle.
          (The compressed version of this paper cannot be mailed.)

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, check out our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.


