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)
Using and combining predictors that specialize
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Branch prediction based on universal data compression algorithms
Proceedings of the 25th annual international symposium on Computer architecture
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Improving the Efficiency of the PPM Algorithm
Problems of Information Transmission
Joint Matrix Universal Coding of Sequences of Independent Symbols
Problems of Information Transmission
Predicting nearly as well as the best pruning of a planar decision graph
Theoretical Computer Science
Empirical Study of Recommender Systems Using Linear Classifiers
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Predicting Nearly as well as the best Pruning of a Planar Decision Graph
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Data Compression Method Combining Properties of PPM and CTW
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Predicting a binary sequence almost as well as the optimal biased coin
Information and Computation
Trees, Windows, and Tiles for Wavelet Image Compression
DCC '00 Proceedings of the Conference on Data Compression
Implementing the Context Tree Weighting Method for Text Compression
DCC '00 Proceedings of the Conference on Data Compression
DCC '02 Proceedings of the Data Compression Conference
Precise Average Redundancy Of An Idealized Arithmetic Coding
DCC '02 Proceedings of the Data Compression Conference
Universal Lossless Compression of Piecewise Stationary Slowly Varying Sources
DCC '01 Proceedings of the Data Compression Conference
Combining PPM Models Using A Text Mining Approach
DCC '01 Proceedings of the Data Compression Conference
Recommender systems using linear classifiers
The Journal of Machine Learning Research
Using a Stochastic Complexity Measure to Check the Efficient Market Hypothesis
Computational Economics
Prediction suffix trees for supervised classification of sequences
Pattern Recognition Letters
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
Hierarchical non-emitting Markov models
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
On modeling profiles instead of values
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Blind construction of optimal nonlinear recursive predictors for discrete sequences
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
Context exhumation after the Burrows-Wheeler transform
Information Processing Letters
Estimating Entropy Rates with Bayesian Confidence Intervals
Neural Computation
2005 Special Issue: The context-tree kernel for strings
Neural Networks - Special issue on neural networks and kernel methods for structured domains
A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption
IEEE Transactions on Computers
Information theory and statistics: a tutorial
Communications and Information Theory
Artificial Intelligence
Adaptive Mixtures of Probabilistic Transducers
Neural Computation
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
The Journal of Machine Learning Research
Spam Filtering Using Statistical Data Compression Models
The Journal of Machine Learning Research
Compressing proteomes: the relevance of medium range correlations
EURASIP Journal on Bioinformatics and Systems Biology
Optimal segmentation using tree models
Knowledge and Information Systems
FPGA Intrinsic PUFs and Their Use for IP Protection
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Fast Bayesian Haplotype Inference Via Context Tree Weighting
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Context Model for Multi-Agent System Reconfiguration
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Email Spam Filtering: A Systematic Review
Foundations and Trends in Information Retrieval
Bias reduction via linear combination of nearest neighbour entropy estimators
International Journal of Information and Coding Theory
Learning prediction suffix trees with Winnow
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
On prediction using variable order Markov models
Journal of Artificial Intelligence Research
Universal source controlled channel decoding with nonsystematic quick-look-in turbo codes
IEEE Transactions on Communications
IEEE Transactions on Signal Processing
A decision-tree-based symbolic rule induction system for text categorization
IBM Systems Journal
Universal estimation of erasure entropy
IEEE Transactions on Information Theory
Representation and compression of multidimensional piecewise functions using surflets
IEEE Transactions on Information Theory
Prediction in wireless networks by Markov Chains
IEEE Wireless Communications
Reducing the space complexity of a Bayes coding algorithm using an expanded context tree
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Unrestricted BIC context tree estimation for not necessarily finite memory processes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Context exhumation after the Burrows--Wheeler transform
Information Processing Letters
Individual sequence prediction using memory-efficient context trees
IEEE Transactions on Information Theory
Compression of whole genome alignments
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
Universal reinforcement learning
IEEE Transactions on Information Theory
Steady-state MSE performance analysis of mixture approaches to adaptive filtering
IEEE Transactions on Signal Processing
Hardware intrinsic security from D flip-flops
Proceedings of the fifth ACM workshop on Scalable trusted computing
Improved context-based adaptive binary arithmetic coding in MPEG-4 AVC/H.264 video codec
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
Markov meets Bayes: technical perspective
Communications of the ACM
Searching a pattern in compressed DNA sequences
International Journal of Bioinformatics Research and Applications
A Monte-Carlo AIXI approximation
Journal of Artificial Intelligence Research
Non-repetitive DNA sequence compression using memoization
ISBMDA'06 Proceedings of the 7th international conference on Biological and Medical Data Analysis
Is there an elegant universal theory of prediction?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
A suffix tree based prediction scheme for pervasive computing environments
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Suffix tree based data compression
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
DNA compression challenge revisited: a dynamic programming approach
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Entire relaxation path for maximum entropy problems
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
General Theory of Information Transfer and Combinatorics
Efficient implementation of true random number generator based on SRAM PUFs
Cryptography and Security
PPM compression without escapes
Software—Practice & Experience
Comparison of SRAM and FF PUF in 65nm technology
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Feature reinforcement learning in practice
EWRL'11 Proceedings of the 9th European conference on Recent Advances in Reinforcement Learning
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Improved adaptive arithmetic coding for HEVC video compression technology
ICCVG'12 Proceedings of the 2012 international conference on Computer Vision and Graphics
On ensemble techniques for AIXI approximation
AGI'12 Proceedings of the 5th international conference on Artificial General Intelligence
Characterizing per-application network traffic using entropy
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Comparative analysis of SRAM memories used as PUF primitives
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Bias-based modeling and entropy analysis of PUFs
Proceedings of the 3rd international workshop on Trustworthy embedded devices
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Better generalization with forecasts
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 755.11 |
Describes a sequential universal data compression procedure for binary tree sources that performs the “double mixture.” Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and storage complexity of the proposed procedure are both linear in the source sequence length. The authors derive a natural upper bound on the cumulative redundancy of the method for individual sequences. The three terms in this bound can be identified as coding, parameter, and model redundancy, The bound holds for all source sequence lengths, not only for asymptotically large lengths. The analysis that leads to this bound is based on standard techniques and turns out to be extremely simple. The upper bound on the redundancy shows that the proposed context-tree weighting procedure is optimal in the sense that it achieves the Rissanen (1984) lower bound