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

DOI10.1016/0167-8655(87)90023-7zbMATH Open0653.68094OpenAlexW2074031475MaRDI QIDQ3799657FDOQ3799657

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

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

zbMATH Keywords

parameter estimationdynamic programmingMarkov networksstructural pattern recognitionlandmark substrings

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Inference algorithms for pattern-based CRFs on sequence data
• A Dynamic Programming Approach to Sequential Pattern Recognition
• Sequential inference with reliable observations: Learning to construct force-dynamic models

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)