A. Poritz. Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on, page 7 -13 vol.1. (April 1988)
DOI: 10.1109/ICASSP.1988.196495
Abstract
Hidden Markov modeling is a probabilistic technique for the study
of time series. Hidden Markov theory permits modeling with any of the
classical probability distributions. The costs of implementation are
linear in the length of data. Models can be nested to reflect
hierarchical sources of knowledge. These and other desirable features
have made hidden Markov methods increasingly attractive for problems in
language, speech and signal processing. The basic ideas are introduced
by elementary examples in the spirit of the Polya urn models. The main
tool in hidden Markov modeling is the Baum-Welch (or forward-backward)
algorithm for maximum likelihood estimation of the model parameters.
This iterative algorithm is discussed both from an intuitive point of
view as an exercise in the art of counting and from a formal point of
view via the information-theoretic Q-function. Selected examples drawn
from the literature illustrate how the Baum-Welch technique places a
rich variety of computational models at the disposal of the researcher
%0 Conference Paper
%1 poritz1988hidden
%A Poritz, A.B.
%B Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on
%D 1988
%K CTII:WS1213 guided hidden markov master model read tour uni ws1213
%P 7 -13 vol.1
%R 10.1109/ICASSP.1988.196495
%T Hidden Markov models: a guided tour
%U http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=196495&tag=1
%X Hidden Markov modeling is a probabilistic technique for the study
of time series. Hidden Markov theory permits modeling with any of the
classical probability distributions. The costs of implementation are
linear in the length of data. Models can be nested to reflect
hierarchical sources of knowledge. These and other desirable features
have made hidden Markov methods increasingly attractive for problems in
language, speech and signal processing. The basic ideas are introduced
by elementary examples in the spirit of the Polya urn models. The main
tool in hidden Markov modeling is the Baum-Welch (or forward-backward)
algorithm for maximum likelihood estimation of the model parameters.
This iterative algorithm is discussed both from an intuitive point of
view as an exercise in the art of counting and from a formal point of
view via the information-theoretic Q-function. Selected examples drawn
from the literature illustrate how the Baum-Welch technique places a
rich variety of computational models at the disposal of the researcher
@inproceedings{poritz1988hidden,
abstract = {Hidden Markov modeling is a probabilistic technique for the study
of time series. Hidden Markov theory permits modeling with any of the
classical probability distributions. The costs of implementation are
linear in the length of data. Models can be nested to reflect
hierarchical sources of knowledge. These and other desirable features
have made hidden Markov methods increasingly attractive for problems in
language, speech and signal processing. The basic ideas are introduced
by elementary examples in the spirit of the Polya urn models. The main
tool in hidden Markov modeling is the Baum-Welch (or forward-backward)
algorithm for maximum likelihood estimation of the model parameters.
This iterative algorithm is discussed both from an intuitive point of
view as an exercise in the art of counting and from a formal point of
view via the information-theoretic Q-function. Selected examples drawn
from the literature illustrate how the Baum-Welch technique places a
rich variety of computational models at the disposal of the researcher
},
added-at = {2012-11-20T14:13:44.000+0100},
author = {Poritz, A.B.},
biburl = {https://www.bibsonomy.org/bibtex/2ecc9ab853f29472c24009aa0af38c82a/telekoma},
booktitle = {Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on},
description = {IEEE Xplore - Hidden Markov models: a guided tour},
doi = {10.1109/ICASSP.1988.196495},
interhash = {bf4931b8de0b3c155fc0a1fe272419ac},
intrahash = {ecc9ab853f29472c24009aa0af38c82a},
issn = {1520-6149},
keywords = {CTII:WS1213 guided hidden markov master model read tour uni ws1213},
month = apr,
pages = {7 -13 vol.1},
timestamp = {2012-11-23T16:30:55.000+0100},
title = {Hidden Markov models: a guided tour},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=196495&tag=1},
year = 1988
}