Computation of Universal Objects for Distributions Over Co-Trees

Henrik Densing Petersen, Flemming Topsøe

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

1 Citationer (Scopus)

Abstract

For an ordered set, consider the model of distributions P for which an element that precedes another element is considered the more significant one in the sense that the implication a ≤ b⇒ P(a) ≥ P(b) holds. It will be shown that if the ordered set is a finite co-tree, then the universal predictor for the model or, equivalently, the corresponding universal code, can be determined exactly via an algorithm of low complexity. Natural relations to problems on the computation of capacity and on the determination of information projections are established. More surprisingly, a direct connection to a problem of isotone regression also appears possible.
OriginalsprogEngelsk
TidsskriftI E E E Transactions on Information Theory
Vol/bind58
Udgave nummer12
Sider (fra-til)7021-7035
ISSN0018-9448
DOI
StatusUdgivet - 2012

Citationsformater