Timezone: »
Prediction suffix trees (PST) provide an effective tool for sequence modelling and prediction. Current prediction techniques for PSTs rely on exact matching between the suffix of the current sequence and the previously observed sequence. We present a provably correct algorithm for learning a PST with approximate suffix matching by relaxing the exact matching condition. We then present a self-bounded enhancement of our algorithm where the depth of suffix tree grows automatically in response to the model performance on a training sequence. Through experiments on synthetic datasets as well as three real-world datasets, we show that the approximate matching PST results in better predictive performance than the other variants of PST.
Author Information
Dongwoo Kim (The Australian National University)
Christian Walder (Data61, the Australian National University)
Related Events (a corresponding poster, oral, or spotlight)
-
2018 Oral: Self-Bounded Prediction Suffix Tree via Approximate String Matching »
Thu Jul 12th 03:30 -- 03:40 PM Room A5
More from the Same Authors
-
2019 Poster: Monge blunts Bayes: Hardness Results for Adversarial Training »
Zac Cranko · Aditya Menon · Richard Nock · Cheng Soon Ong · Zhan Shi · Christian Walder -
2019 Oral: Monge blunts Bayes: Hardness Results for Adversarial Training »
Zac Cranko · Aditya Menon · Richard Nock · Cheng Soon Ong · Zhan Shi · Christian Walder -
2018 Poster: Neural Dynamic Programming for Musical Self Similarity »
Christian Walder · Dongwoo Kim -
2018 Oral: Neural Dynamic Programming for Musical Self Similarity »
Christian Walder · Dongwoo Kim -
2017 Poster: Fast Bayesian Intensity Estimation for the Permanental Process »
Christian Walder · Adrian N Bishop -
2017 Talk: Fast Bayesian Intensity Estimation for the Permanental Process »
Christian Walder · Adrian N Bishop