scientific article; zbMATH DE number 2243374

MaRDI QIDQ5715686zbMATH OpenFDO

Authors Ron Begleiter, Golan Yona, Ran El-Yaniv

Publication date 4 January 2006

Full work available at URL https://arxiv.org/abs/1107.0051

Mathematics Subject Classification ID

Prediction theory (aspects of stochastic processes) (60G25) Learning and adaptive systems in artificial intelligence (68T05) Biochemistry, molecular biology (92C40)

Recommendations

• Sparse Markov chains for sequence data
• On Context-Tree Prediction of Individual Sequences
• scientific article; zbMATH DE number 1931834
• Predicting the future of discrete sequences from fractal representations of the past
• A note on sequence prediction over large alphabets

Cited in

(26)

• Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
• Quantifying the generalization capacity of Markov models for melody prediction
• Testing statistical hypothesis on random trees and applications to the protein classification problem
• Using a VOM model for reconstructing potential coding regions in EST sequences
• Macroeconomic simulation comparison with a multivariate extension of the Markov information criterion
• Predictive modelling of heterogeneous sequence collections by topographic ordering of histories
• Algorithms for learning parsimonious context trees
• Compressing parameters in Bayesian high-order models with application to logistic sequence models
• Sparse Markov chains for sequence data
• scientific article; zbMATH DE number 4143167 (Why is no real title available?)
• On Context-Tree Prediction of Individual Sequences
• scientific article; zbMATH DE number 1931834 (Why is no real title available?)
• scientific article; zbMATH DE number 769143 (Why is no real title available?)
• Recursive learning for sparse Markov models
• Structural Statistical Software Testing with Active Learning in a Graph
• Bayesian analysis of variable-order, reversible Markov chains
• Predicting the future of discrete sequences from fractal representations of the past
• Online text prediction with recurrent neural networks
• Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
• Trajectory modeling via random utility inverse reinforcement learning
• Computation of exact probabilities associated with overlapping pattern occurrences
• Approximate learning of parsimonious Bayesian context trees
• Computational analysis of musical elements across twenty-two European countries
• A hidden Markov model with dependence jumps for predictive modeling of multidimensional time-series
• Distributions of pattern statistics in sparse Markov models
• Text classification using word-based PPM models

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5715686)