CaltechAUTHORS
  A Caltech Library Service

Probabilistic independence networks for hidden Markov probability models

Smyth, Padhraic and Heckerman, David and Jordan, Michael I. (1997) Probabilistic independence networks for hidden Markov probability models. Neural Computation, 9 (2). pp. 227-269. ISSN 0899-7667. http://resolver.caltech.edu/CaltechAUTHORS:SMYnc97

[img]
Preview
PDF - Published Version
See Usage Policy.

419Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:SMYnc97

Abstract

Graphical techniques for modeling the dependencies of random variables have been explored in a variety of different areas, including statistics, statistical physics, artificial intelligence, speech recognition, image processing, and genetics. Formalisms for manipulating these models have been developed relatively independently in these research communities. In this paper we explore hidden Markov models (HMMs) and related structures within the general framework of probabilistic independence networks (PINs). The paper presents a self-contained review of the basic principles of PINs. It is shown that the well-known forward-backward (F-B) and Viterbi algorithms for HMMs are special cases of more general inference algorithms for arbitrary PINs. Furthermore, the existence of inference and estimation algorithms for more general graphical models provides a set of analysis tools for HMM practitioners who wish to explore a richer class of HMM structures. Examples of relatively complex models to handle sensor fusion and coarticulation in speech recognition are introduced and treated within the graphical model framework to illustrate the advantages of the general approach.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1162/neco.1997.9.2.227DOIUNSPECIFIED
http://www.mitpressjournals.org/doi/abs/10.1162/neco.1997.9.2.227PublisherUNSPECIFIED
Additional Information:© 1997 Massachusetts Institute of Technology. Received February 2, 1996; accepted April 22, 1996; posted online March 13, 2006. MIJ gratefully acknowledges discussions with Steffen Lauritzen on the application of the IPF algorithm to UPINs. The research described in this article was carried out in part by the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration.
Funders:
Funding AgencyGrant Number
NASAUNSPECIFIED
Subject Keywords:STOCHASTIC RELAXATION; GRAPHICAL STRUCTURES; EXPERT SYSTEMS; FIELDS.
Record Number:CaltechAUTHORS:SMYnc97
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:SMYnc97
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:13671
Collection:CaltechAUTHORS
Deposited By: Jason Perez
Deposited On:25 Jun 2009 16:45
Last Modified:26 Dec 2012 10:53

Repository Staff Only: item control page