DocumentCode :
1263511
Title :
Computation of Universal Objects for Distributions Over Co-Trees
Author :
Petersen, Henrik Densing ; Topsøe, Flemming
Author_Institution :
Dept. of Math. Sci., Univ. of Copenhagen, Copenhagen, Denmark
Volume :
58
Issue :
12
fYear :
2012
Firstpage :
7021
Lastpage :
7035
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 abP(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.
Keywords :
regression analysis; tree codes; computational complexity; finite co-tree; isotone regression problem; universal code; universal objects; universal predictor; Approximation algorithms; Prediction algorithms; Predictive models; Redundancy; Regression analysis; Algorithm; co-tree; isotone regression; universal code; universal predictor;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2012.2210477
Filename :
6266746
Link To Document :
بازگشت