Metraipolis › archive › dc_5eda26639009

Hidden Markov random field — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Hidden_Markov_random_field
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:16:01.011Z
SHA-256 of the archived text
24a541261967938a3c7d1a638ecaf5231062c2850f91add3b1c80adc31bf0eaf
Stable URL of this page
https://metraipolis.com/documento/dc_5eda26639009

How to cite

Hidden Markov random field — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Hidden_Markov_random_field (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5eda26639009 (Metraipolis archive dc_5eda26639009, sha256 24a541261967938a3c7d1a638ecaf5231062c2850f91add3b1c80adc31bf0eaf)
BibTeX
@misc{dc5eda26639009,
  title = {Hidden Markov random field — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Hidden_Markov_random_field},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5eda26639009; sha256 24a541261967938a3c7d1a638ecaf5231062c2850f91add3b1c80adc31bf0eaf},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Hidden_Markov_random_field. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In statistics, a hidden Markov random field is a generalization of a hidden Markov model. Instead of having an underlying Markov chain, hidden Markov random fields have an underlying Markov random field. Suppose that we observe a random variable Y i {\displaystyle Y_{i}} , where i ∈ S {\displaystyle i\in S} . Hidden Markov random fields assume that the probabilistic nature of Y i {\displaystyle Y_{i}} is determined by the unobservable Markov random field X i {\displaystyle X_{i}} , i ∈ S {\displaystyle i\in S} . That is, given the neighbors N i {\displaystyle N_{i}} of X i , X i {\displaystyle X_{i},X_{i}} is independent of all other X j {\displaystyle X_{j}} (Markov property). The main difference with a hidden Markov model is that neighborhood is not defined in 1 dimension but within a network, i.e. X i {\displaystyle X_{i}} is allowed to have more than the two neighbors that it would have in a Markov chain. The model is formulated in such a way that given X i {\displaystyle X_{i}} , Y i {\displaystyle Y_{i}} are independent (conditional independence of the observable variables given the Markov random field). In the vast majority of the related literature, the number of possible latent states is considered a user-defined constant. However, ideas from nonparametric Bayesian statistics, which allow for data-driven inference of the number of states, have been also recently investigated with success, e.g.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «Bayesian statistics»).
Fonte: Wikipedia in inglese, voce «Hidden Markov random field» — https://en.wikipedia.org/wiki/Hidden_Markov_random_field
Wikidata Q8479172 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q8479172
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Hidden_Markov_random_field?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1365422110, consultata il 2026-10-07T21:57:08.536Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 1fd4a5dddca8622994e7034333fb6127e7f694fc6cbecfb45abb70ca5657ee14