Predicting nearly as well as the best pruning of a decision tree
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Predicting Nearly As Well As the Best Pruning of a Decision Tree
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
An efficient extension to mixture techniques for prediction and decision trees
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning Markov chains with variable memory length from noisy output
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
LeZi-update: an information-theoretic framework for personal mobility tracking in PCS networks
Wireless Networks - Selected Papers from Mobicom'99
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Using a Stochastic Complexity Measure to Check the Efficient Market Hypothesis
Computational Economics
Mistake-driven mixture of hierarchical tag context trees
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Lossless compression of map contours by context tree modeling of chain codes
Pattern Recognition
Markov and multifractal wavelet models for wireless MAC-to-MAC channels
Performance Evaluation
Optimal segmentation using tree models
Knowledge and Information Systems
Context Model for Multi-Agent System Reconfiguration
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
A novel sequence representation for unsupervised analysis of human activities
Artificial Intelligence
Universal source controlled channel decoding with nonsystematic quick-look-in turbo codes
IEEE Transactions on Communications
Deinterleaving Markov processes via penalized ML
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Twice-universal simulation of Markov sources and individual sequences
IEEE Transactions on Information Theory
INFORMS Journal on Computing
Lossless compression of map contours by context tree modeling of chain codes
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
| Hi-index | 754.90 |
An irreducible parameterization for a finite memory source is constructed in the form of a tree machine. A universal information source for the set of finite memory sources is constructed by a predictive modification of an earlier studied algorithm-Context. It is shown that this universal source incorporates any minimal data-generating tree machine in an asymptotically optimal manner in the following sense: the negative logarithm of the probability it assigns to any long typical sequence, generated by any tree machine, approaches that assigned by the tree machine at the best possible rate