Probabilistic Independence Networks for Hidden Markov Probability Models
From MaRDI portal
Publication:3125232
DOI10.1162/NECO.1997.9.2.227zbMATH Open0869.68083DBLPjournals/neco/SmythHJ97OpenAlexW2147496287WikidataQ41444163 ScholiaQ41444163MaRDI QIDQ3125232FDOQ3125232
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/
Recommendations
Cites Work
- Estimating the dimension of a model
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Sequential updating of conditional probabilities on directed graphical structures
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- Statistical Inference for Probabilistic Functions of Finite State Markov Chains
- Independence properties of directed markov fields
- On the effective implementation of the iterative proportional fitting procedure
- An Introduction to Spatial Point Processes and Markov Random Fields
- Probabilistic expert systems and graphical modelling: a case study in drug safety
Cited In (12)
- Latent class models for diary method data: Parameter estimation by local computations
- Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains
- Network inference from temporally dependent grouped observations
- Distributed systems estimators and packet delivery prediction based on recursive Bayesian estimation
- Designing neural networks that process mean values of random variables
- A simplified matrix formulation for sensitivity analysis of hidden Markov models
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- Variational approximations for categorical causal modeling with latent variables
- Generalized Baum-Welch and Viterbi algorithms based on the direct dependency among observations
- Sequential inference of Markov networks by dynamic programming for structural pattern recognition
- Efficient sensitivity analysis in hidden Markov models
- Induction of word and phrase alignments for automatic document summarization
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)
