Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

A POSTERIORI PROBABILITY DISTANCES BETWEEN FINITE-ALPHABET HIDDEN MARKOV MODELS

Loading...
Thumbnail Image

Date

Authors

Xie, Li
Ugrinovskii, Valery A.
Petersen, Ian R.

Journal Title

Journal ISSN

Volume Title

Publisher

Access Statement

Research Projects

Organizational Units

Journal Issue

Abstract

In this paper, we consider a probability distance problem for a class of hidden Markov models (HMMs). The notion of regular conditional relative entropy between regular conditional probability measures is introduced as an a posteriori probability distance when a realized observation sequence is observed. Using a measure change and a relation between the Radon-Nikodym derivatives of probability measures and regular conditional probability measures, we derive a representation for regular conditional relative entropy. With this representation, we can calculate this distance using an information state approach. The regular conditional relative entropy rate is also considered.

Description

Citation

Source

IFAC-PapersOnLine

Book Title

Entity type

Publication

Access Statement

License Rights

Restricted until

abcd