Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources
A binary FSMX source generates a given sequence of digits from {0, l} whose statistical behavior can be described using a postfix set S. This postfix set is a collection of binary strings which is proper and complete. To weigh an infinite number of models, the authors introduce a principle which say...
Uložené v:
| Vydané v: | IEEE International Symposium on Information Theory, 1993 s. 59 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
1993
|
| Predmet: | |
| ISBN: | 9780780308787, 0780308786 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | A binary FSMX source generates a given sequence of digits from {0, l} whose statistical behavior can be described using a postfix set S. This postfix set is a collection of binary strings which is proper and complete. To weigh an infinite number of models, the authors introduce a principle which says that the model-redundancy has to be proportional to the number of free parameters of the model. It gives us a weighting distribution over all models. A efficient method is outlines that weighs the block probabilities of all models according to this distribution. |
|---|---|
| Bibliografia: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISBN: | 9780780308787 0780308786 |
| DOI: | 10.1109/ISIT.1993.748374 |

