Open AccessProceedings Article
Bayesian variable order Markov models
Christos Dimitrakakis
- 31 Mar 2010
- Vol. 9, pp 161-168
TL;DR: A simple, effective generalisation of variable order Markov models to full online Bayesian estimation, close to that employed in context tree weighting, with the addition of a prior, conditioned on context, on the Markov order.
read more
Abstract: We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree weighting. The main contribution is the addition of a prior, conditioned on context, on the Markov order. The resulting construction uses a simple recursion and can be updated efficiently. This allows the model to make predictions using more complex contexts, as more data is acquired, if necessary. In addition, our model can be alternatively seen as a mixture of tree experts. Experimental results show that the predictive model exhibits consistently good performance in a variety of domains.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Personalized News Recommendation with Context Trees
TL;DR: This paper introduces a class of news recommendation systems based on context trees that can provide high-quality news recommendations to anonymous visitors based on present browsing behaviour and shows that they make accurate and novel recommendations, and that they are sufficiently flexible for the challenges ofNews recommendation.
Personalized news recommendation with context trees
Florent Garcin,Christos Dimitrakakis,Boi Faltings +2 more
- 12 Oct 2013
TL;DR: In this article, the authors introduce a class of news recommendation systems based on context trees, which can provide high-quality news recommendations to anonymous visitors based on present browsing behavior, using an unbiased testing methodology, they show that they make accurate and novel recommendations, and that they are sufficiently flexible for the challenges of news recommender.
•Proceedings Article
A personalized interest-forgetting Markov model for recommendations
Jun Chen,Chaokun Wang,Jianmin Wang +2 more
- 25 Jan 2015
TL;DR: This paper considered people's forgetting of interest when performing personalized recommendations, and brought forward a personalized framework to integrate interest-forgetting property with Markov model.
50
Bayesian Nonparametric Methods for Partially-Observable Reinforcement Learning
TL;DR: In this article, the authors explore learning representations of stochastic systems using Bayesian nonparametric statistics, which allow the sophistication of a representation to scale gracefully with the complexity in the data.
49
•Proceedings Article
Adaptive Sequential Recommendation for Discussion Forums on MOOCs Using Context Trees.
Fei Mi,Boi Faltings +1 more
- 01 Jun 2017
TL;DR: The results show that the CT recommender performs better than other methods for MOOCs forum recommendation task and it is demonstrated that it is because of better adaptation to changes in the domain.
References
Sequential Monte Carlo methods in practice
Arnaud Doucet,Nando de Freitas,Neil Gordon,Adrian F. M. Smith +3 more
- 01 Jan 2001
TL;DR: This book presents the first comprehensive treatment of Monte Carlo techniques, including convergence results and applications to tracking, guidance, automated target recognition, aircraft navigation, robot navigation, econometrics, financial modeling, neural networks, optimal control, optimal filtering, communications, reinforcement learning, signal enhancement, model averaging and selection.
•Book
Prediction, learning, and games
Nicolò Cesa-Bianchi,Gábor Lugosi +1 more
- 01 Jan 2006
TL;DR: In this paper, the authors provide a comprehensive treatment of the problem of predicting individual sequences using expert advice, a general framework within which many related problems can be cast and discussed, such as repeated game playing, adaptive data compression, sequential investment in the stock market, sequential pattern analysis, and several other problems.
Prediction, Learning, and Games
Nicolò Cesa‐Bianchi,Gábor Lugosi +1 more
- 13 Mar 2006
TL;DR: Prediction of individual sequences does not impose probabilistic assumptions, yet algorithms can achieve performance nearly as good as the best forecasting strategy.
3K