Text compression
Elements of information theory
Elements of information theory
On the Computational Complexity of Approximating Distributions by Probabilistic Automata
Machine Learning - Computational learning theory
Fundamentals of speech recognition
Fundamentals of speech recognition
The design and analysis of efficient lossless data compression systems
The design and analysis of efficient lossless data compression systems
The data compression book (2nd ed.)
The data compression book (2nd ed.)
The power of amnesia: learning probabilistic automata with variable memory length
Machine Learning - Special issue on COLT '94
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Texture Mixing and Texture Movie Synthesis Using Statistical Learning
IEEE Transactions on Visualization and Computer Graphics
Playing With Virtual Musicians: The Continuator in Practice
IEEE MultiMedia
Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains
ECML '02 Proceedings of the 13th European Conference on Machine Learning
Maximum Entropy Markov Models for Information Extraction and Segmentation
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Using the Fisher Kernel Method to Detect Remote Protein Homologies
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
Context-Tree Weighting Method for Text Generating Sources
DCC '97 Proceedings of the Conference on Data Compression
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
Text Compression by Context Tree Weighting
DCC '97 Proceedings of the Conference on Data Compression
Text Mining: A New Frontier for Lossless Compression
DCC '99 Proceedings of the Conference on Data Compression
DCC '99 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
PPMexe: PPM for Compressing Software
DCC '02 Proceedings of the Data Compression Conference
Compressing XML with Multiplexed Hierarchical PPM Models
DCC '01 Proceedings of the Data Compression Conference
Concentration inequalities for the missing mass and for histogram rule error
The Journal of Machine Learning Research
Part-of-speech tagging using a Variable Memory Markov model
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Adaptive Mixtures of Probabilistic Transducers
Neural Computation
On-line algorithms for combining language models
ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02
Prediction of protein structural classes by a new measure of information discrepancy
Computational Biology and Chemistry
Redundancy of the Lempel-Ziv incremental parsing rule
IEEE Transactions on Information Theory
The context-tree weighting method: extensions
IEEE Transactions on Information Theory
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
A strong version of the redundancy-capacity theorem of universal coding
IEEE Transactions on Information Theory
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
The Journal of Machine Learning Research
Predicting future locations using prediction-by-partial-match
Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Labelling the Structural Parts of a Music Piece with Markov Models
Computer Music Modeling and Retrieval. Genesis of Meaning in Sound and Music
Probabilistic models for melodic prediction
Artificial Intelligence
Providing predictions on distributed HMMs with privacy
Artificial Intelligence Review
A machine learning approach for statistical software testing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Automatic Generation of String Signatures for Malware Detection
RAID '09 Proceedings of the 12th International Symposium on Recent Advances in Intrusion Detection
Structural statistical software testing with active learning in a graph
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Predicting user-cell association in cellular networks from tracked data
MELT'09 Proceedings of the 2nd international conference on Mobile entity localization and tracking in GPS-less environments
MAITH: a meta-software agent for issue tracking help
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Industry track
Modeling player performance in rhythm games
ACM SIGGRAPH ASIA 2010 Sketches
A Monte-Carlo AIXI approximation
Journal of Artificial Intelligence Research
Pattern induction and matching in music signals
CMMR'10 Proceedings of the 7th international conference on Exploring music contents
A suffix tree based prediction scheme for pervasive computing environments
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Modeling sequences of user actions for statistical goal recognition
User Modeling and User-Adapted Interaction
HIS'12 Proceedings of the First international conference on Health Information Science
Mobility prediction in mobile wireless networks
Journal of Network and Computer Applications
Modeling complex temporal composition of actionlets for activity prediction
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Personalized news recommendation with context trees
Proceedings of the 7th ACM conference on Recommender systems
Session modeling to predict online buyer behavior
Proceedings of the 2013 workshop on Data-driven user behavioral modelling and mining from social media
MPaaS: Mobility prediction as a service in telecom cloud
Information Systems Frontiers
Hi-index | 0.00 |
This paper is concerned with algorithms for prediction of discrete sequences over a finite alphabet, using variable order Markov models. The class of such algorithms is large and in principle includes any lossless compression algorithm. We focus on six prominent prediction algorithms, including Context Tree Weighting (CTW), Prediction by Partial Match (PPM) and Probabilistic Suffix Trees (PSTs). We discuss the properties of these algorithms and compare their performance using real life sequences from three domains: proteins, English text and music pieces. The comparison is made with respect to prediction quality as measured by the average log-loss. We also compare classification algorithms based on these predictors with respect to a number of large protein classification tasks. Our results indicate that a "decomposed" CTW (a variant of the CTW algorithm) and PPM outperform all other algorithms in sequence prediction tasks. Somewhat surprisingly, a different algorithm, which is a modification of the Lempel-Ziv compression algorithm, significantly outperforms all algorithms on the protein classification problems.