Cited by 226Bayesian Methods and Mixture ModelsSpeech Recognition and SynthesisControl Systems and Identification

An efficient forward-backward algorithm for an explicit-duration hidden Markov model

Shun-Zheng Yu, Kobayashi, H.·2003·IEEE Signal Processing Letters

Abstract

Existing algorithms for estimating the model parameters of an explicit-duration hidden Markov model (HMM) usually require computations as large as O((MD/sup 2/ + M/sup 2/)T) or O(M/sup 2/ DT), where M is the number of states; D is the maximum possible interval between state transitions; and T is the period of observations used to estimate the model parameters. Because of such computational requirements, these algorithms are not practical when we wish to construct an HMM model with large state space and large explicit state duration and process a large amount of measurement data to obtain high accuracy. We propose a new forward-backward algorithm whose computational complexity is only O((MD + M/sup 2/)T), a reduction by almost a factor of D when D > M and whose memory requirement is O(MT). As an application example, we discuss an HMM characterization of access traffic observed at a large-scale Web site: we formulate the Web access pattern in terms of an HMM with explicit duration and estimate the model parameters using our algorithm.

Integrity signals

Registry

Crossref · 10.1109/lsp.2002.806705

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The most common choice for modeling the state duration is the multinomial due to its simplicity.

    “The most common choice for modeling the state duration is the multinomial [18,21,34,43] due to its simplicity.”
  • By taking advantage of the determinism of m_t, the complexity of HSMM can be reduced to O(|Q|^2 M T), or even better to O((|Q|M+|Q|^2)T).

    “By taking advantage of the determinism of m t (i.e.conditionally on a given state, m t+1 = m t -1), the complexity can be reduced to O (|Q | 2 M T ), or even better to O ((|Q |M +|Q | 2 )T )”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Yu, S.-Z., & Kobayashi, H.
Affiliations
Princeton University (US)
Venue
IEEE Signal Processing Letters
Published
2003-01
Volume
10
Issue
1
Pages
11-14
ISSN
  • 1070-9908 (ISSN-L)
  • 1558-2361
OpenAlex
W2153331007
Cited by
226
References
10
Citations by year
2026: 1 · 2025: 5 · 2024: 11 · 2023: 6 · 2022: 8 · 2021: 10 · 2020: 11 · 2019: 12 · 2018: 11 · 2017: 16 · 2016: 10 · 2015: 12 · 2014: 19 · 2013: 13 · 2012: 12
FWCI
5.68
Type
journal article
Language
en
Open access
closed
Locations
IEEE Signal Processing Letters (publishedVersion)
Funders
George Mason University
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
  • Physical Sciences › Computer Science › Artificial Intelligence › Speech Recognition and Synthesis
  • Physical Sciences › Engineering › Control and Systems Engineering › Control Systems and Identification
Keywords
forward-backward algorithm, parameter estimation, computational complexity reduction, space complexity, web traffic modeling, state duration

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review