Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,199,015 papers from all fields of science
Search
Sign In
Create Free Account
Prediction Suffix Tree
A Prediction Suffix Tree is a mathematical technique for modelling sequences.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Self-Bounded Prediction Suffix Tree via Approximate String Matching Appendix for Self-Bounded Prediction Suffix Tree via Approximate String Matching A . Proof of Lemma 2
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…
Expand
2018
2018
Self-Bounded Prediction Suffix Tree via Approximate String Matching
Dongwoo Kim
,
Christian J. Walder
International Conference on Machine Learning
2018
Corpus ID: 3631061
Prediction suffix trees (PST) provide an effective tool for sequence modelling and prediction. Current prediction techniques for…
Expand
2014
2014
Control your information for better predictions
Michal Moshkovitz
,
Naftali Tishby
IEEE International Symposium on Information…
2014
Corpus ID: 14256591
We suggest a unified view of two known prediction algorithms: Context Tree Weighting (CTW) and Prediction Suffix Tree (PST), by…
Expand
2011
2011
Analysis and Grouping of Movable Object Patterns Using Similarity Measure of Trajectories in Wireless Sensor Networks
Vijayasaradhi Thommandru
,
Subramanyam Kodukula
,
Vamsidhar Talasila
,
Anusha Peruri
2011
Corpus ID: 17772305
Many natural phenomena show that objects often exhibit some degree of regularity in their movements. However, previous works…
Expand
2006
2006
Markov Chains for Solving the Telecommunication Networks Protection Task
N.A. Nerubenko
,
M. Ternovoy
16th International Crimean Microwave and…
2006
Corpus ID: 24042461
In this paper the method providing telecommunication networks security on the basis of variable length Markov chains is proposed…
Expand
2005
2005
Toward a Unified Framework for Inference of Hidden State under Partial Observability
Michael P. Holmes
,
C. Isbell
2005
Corpus ID: 6522225
While various techniques exist for learning in partially observable environments such as POMDPs, there has yet to emerge a…
Expand
2003
2003
Online Prediction of Semi-structured Data Streams and Its Application to XML Data Compression
S. Kawano
,
Hiroki Arimura
,
S. Arikawa
2003
Corpus ID: 56313697
Discrete sequence prediction has a wide range of applications, e.g., sequence pattern discovery, anomaly detection, biological…
Expand
2003
2003
Prediction suffix trees for supervised classification of sequences
C. Largeron
Pattern Recognition Letters
2003
Corpus ID: 11283892
2002
2002
Information Explication from Computer-Transcribed Conversations: The Weighted Markov Classifier
N. Eagle
2002
Corpus ID: 19745223
In this research, I attempt to extract information from a computer-transcribed conversation. Leveraging the SDK of a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE