CoChat

A Revealing Introduction to Hidden Markov Models

Stamp, Mark · 2017 · Introduction to Machine Learning with Applications in Information Security
Cited by 184

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

This chapter consider a simple example to motivate the hidden Markov model (HMM) formulation. HMMs are based on discrete probability. While the formulation of HMMs might initially seem somewhat contrived, there exist a virtually unlimited number of problems where the technique can be applied. Dynamic programming (DP) can be used to efficiently solve this problem. On the other hand, we might reasonably define "most likely" as the state sequence that maximizes the expected number of correct states. An HMM can be used to find the most likely hidden state sequence. The chapter summarises the notation used in an HMM. It considers critical computational issues that must be addressed when writing any HMM computer program. HMM are powerful, efficient, and extremely useful in practice. Virtually no assumptions need to be made, yet the HMM process can extract significant statistical information from data.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1201/9781315213262-2

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 184

Metadata

Authors
Stamp, M.
Venue
Introduction to Machine Learning with Applications in Information Security
Published
2017-09-22
Pages
7-35
OpenAlex
W2903953076
Cited by
184
References
1
FWCI
27.32
Type
book chapter
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Revealing Introduction to Hidden Markov Models. https://app.cochat.ai/papers/10.1201/9781315213262-2
The paper
Stamp, M. (2017). A Revealing Introduction to Hidden Markov Models. Introduction to Machine Learning with Applications in Information Security. https://doi.org/10.1201/9781315213262-2

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.