Probabilistic Independence Networks for Hidden Markov Probability Models

DOI10.1162/NECO.1997.9.2.227MaRDI QIDQ3125232zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Padhraic Smyth, David Heckerman, Michael Jordan

Publication date 18 March 1997

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://authors.library.caltech.edu/13671/

zbMATH Keywords

graphical techniqueshidden Markov modelsprobabilistic independence networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Hidden Markov Models for Speech Recognition
• Factorial hidden Markov models
• scientific article; zbMATH DE number 475218
• scientific article; zbMATH DE number 1767710

Cites work

• An Introduction to Spatial Point Processes and Markov Random Fields
• Estimating the dimension of a model
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Independence properties of directed markov fields
• Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
• On the effective implementation of the iterative proportional fitting procedure
• Probabilistic expert systems and graphical modelling: a case study in drug safety
• Sequential updating of conditional probabilities on directed graphical structures
• Statistical Inference for Probabilistic Functions of Finite State Markov Chains
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

Cited in

(13)

• A simplified matrix formulation for sensitivity analysis of hidden Markov models
• Network inference from temporally dependent grouped observations
• Variational approximations for categorical causal modeling with latent variables
• Distributed systems estimators and packet delivery prediction based on recursive Bayesian estimation
• Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains
• Efficient sensitivity analysis in hidden Markov models
• Latent class models for diary method data: Parameter estimation by local computations
• Induction of word and phrase alignments for automatic document summarization
• Sequential inference of Markov networks by dynamic programming for structural pattern recognition
• Generalized Baum-Welch and Viterbi algorithms based on the direct dependency among observations
• Partially hidden Markov models
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• Designing neural networks that process mean values of random variables

This page was built for publication: Probabilistic Independence Networks for Hidden Markov Probability Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3125232)