Sequential inference of Markov networks by dynamic programming for structural pattern recognition

DOI10.1016/0167-8655(87)90023-7MaRDI QIDQ3799657zbMATH OpenOpenAlexFDO

Authors Michael G. Thomason, Erik Granum

Publication date 1987

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(87)90023-7

zbMATH Keywords

parameter estimationdynamic programmingMarkov networksstructural pattern recognitionlandmark substrings

Mathematics Subject Classification ID

Inference from stochastic processes (62M99) Pattern recognition, speech recognition (68T10)

Recommendations

• A Dynamic Programming Approach to Sequential Pattern Recognition
• Inference algorithms for pattern-based CRFs on sequence data
• Markov models for pattern recognition. From theory to applications.
• Probabilistic Independence Networks for Hidden Markov Probability Models
• Markov models for pattern recognition. From theory to applications

Cited in

(4)

• Sequential inference with reliable observations: Learning to construct force-dynamic models
• A Dynamic Programming Approach to Sequential Pattern Recognition
• scientific article; zbMATH DE number 4088703 (Why is no real title available?)
• Inference algorithms for pattern-based CRFs on sequence data

This page was built for publication: Sequential inference of Markov networks by dynamic programming for structural pattern recognition

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