Skip to search formSkip to main contentSkip to account menu

Prediction Suffix Tree

A Prediction Suffix Tree is a mathematical technique for modelling sequences.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
  • 2018
  • Corpus ID: 260446791
Lemma 5. Let !(i, k) = ((1 ⇠)k i exp( )/i!)1/2. Given binary sequence y 1 1 and arbitrary suffix tree T equipped with Hamming… 
2018
2018
Prediction suffix trees (PST) provide an effective tool for sequence modelling and prediction. Current prediction techniques for… 
2014
2014
We suggest a unified view of two known prediction algorithms: Context Tree Weighting (CTW) and Prediction Suffix Tree (PST), by… 
2011
2011
Many natural phenomena show that objects often exhibit some degree of regularity in their movements. However, previous works… 
2006
2006
In this paper the method providing telecommunication networks security on the basis of variable length Markov chains is proposed… 
2005
2005
While various techniques exist for learning in partially observable environments such as POMDPs, there has yet to emerge a… 
2003
2003
Discrete sequence prediction has a wide range of applications, e.g., sequence pattern discovery, anomaly detection, biological… 
2002
2002
In this research, I attempt to extract information from a computer-transcribed conversation. Leveraging the SDK of a…