Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Variable-order Markov model

Known as: Variable order Markov model, Variable order Markov models, Variable-Order Markov Models 
In stochastic processes, Variable-order Markov (VOM) models are an important class of models that extend the well known Markov chain models. In… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Due to the booming industry of location-based services, the analysis of human location histories is increasingly important. Next… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2014
2014
Variable-order Markov Model(VLMM) is a simple but effective model for event sequences modeling. However, the classic VLMM only… Expand
Is this relevant?
2014
2014
Markov processes are widely used to generate sequences that imitate a given style, using random walk. Random walk generates… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
Clustering categorical sequences is an important and difficult data mining task. Despite recent efforts, the challenge remains… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 4
Is this relevant?
2010
2010
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism… Expand
  • figure 1
  • figure 2
Is this relevant?
2009
2009
The recognition of the goal a user is pursing when interacting with a software application is a crucial task for an interface… Expand
  • figure 1
Is this relevant?
2009
2009
A key aspect to study in the field of interface agents is the need to detect as soon as possible the user intentions. User… Expand
Is this relevant?
2007
2007
Identifying the location and function of human genes in a long sequence of genome is difficult due to lack of sufficient… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper is concerned with algorithms for prediction of discrete sequences over a finite alphabet, using variable order Markov… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
In this paper, we compare Probabilistic Suffix Trees (PST), recently proposed, to a specific smoothing of Markov chains and show… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?