Individual Sequence Prediction Using Memory-Efficient Context Trees

No abstract is available for this paper.

• Publication year

  2009

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2009-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2009.2030460
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Online learning: theory, algorithms and applications (למידה מקוונת.)

  2007influential reference
• Tracking the best hyperplane with a simple budget Perceptron

  2006cited by this paper
• Prediction, learning, and games

  2006cited by this paper
• Convex Repeated Games and Fenchel Duality

  2006cited by this paper
• Online Passive-Aggressive Algorithms

  2003cited by this paper
• Optimal Amnesic Probabilistic Automata or How to Learn and Classify Proteins in Linear Time and Space

  2000cited by this paper
• The Robustness of the p-Norm Algorithms

  1999cited by this paper
• Variable length Markov chains

  1999cited by this paper
• An Efficient Extension to Mixture Techniques for Prediction and Decision Trees

  1997cited by this paper
• The power of amnesia: Learning probabilistic automata with variable memory length

  1996cited by this paper
• Predicting Nearly As Well As the Best Pruning of a Decision Tree

  1995cited by this paper
• The context-tree weighting method: basic properties

  1995cited by this paper
• Extensions to the context tree weighting method

  1994cited by this paper
• Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources

  1993cited by this paper
• Universal prediction of individual sequences

  1991influential reference
• Asymptotically Subminimax Solutions of Compound Statistical Decision Problems

  1985cited by this paper
• Compression of individual sequences via variable-rate coding

  1978cited by this paper
• Compound Bayes Predictors for Sequences with Apparent Markov Structure

  1977influential reference
• Pattern classification and scene analysis

  1974cited by this paper
• Nearest neighbor pattern classification

  1967cited by this paper
• Behavior of sequential predictors of binary sequences

  1965influential reference
• ON CONVERGENCE PROOFS FOR PERCEPTRONS

  1963influential reference
• The perceptron: a probabilistic model for information storage and organization in the brain.

  1958cited by this paper
• 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY

  1958cited by this paper
• An analog of the minimax theorem for vector payoffs.

  1956cited by this paper
• The Relaxation Method for Linear Inequalities

  1954cited by this paper
• Contributions to the theory of games

  1953cited by this paper

• A framework for space-efficient variable-order Markov models

  2018influential citation
• An aggregating strategy for shifting experts in discrete sequence prediction

  2017cites this paper
• A Framework for Space-Efficient String Kernels

  2015cites this paper
• Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression

  2015cites this paper
• Negotiation context analysis in electricity markets

  2015cites this paper
• Context and Machine Learning

  2014cites this paper
• Efficient Online Sequence Prediction with Side Information

  2013influential citation
• Learning the Experts for Online Sequence Prediction

  2012influential citation
• Incremental Prediction for Sequential Data

  2010cites this paper
• Learning in dynamic temporal domains using contextual prediction entropy as a guiding principle

  2010cites this paper
• Learning a Prior for Lifelong Visual Object Categorization

  year unknowncites this paper