Using Positional Suffix Trees to Perform Agile Tree Kernel Calculation

Suffix Trees as Language Models

Suffix trees are data structures that can be used to index a corpus. In this paper, we explore how some properties of suffix trees naturally provide the functionality of an n-gram language model with variable n. We expla…

Self-Bounded Prediction Suffix Tree via Approximate String Matching

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 o…

Compact, Efficient and Unlimited Capacity: Language Modeling with Compressed Suffix Trees

Learning Partially Observable Models Using Temporally Abstract Decision Trees

This paper introduces timeline trees, which are partial models of partially observable environments. Timeline trees are given some specific predictions to make and learn a decision tree over history. The main idea of tim…

Complex Event Forecasting with Prediction Suffix Trees: Extended Technical Report

Complex Event Recognition (CER) systems have become popular in the past two decades due to their ability to "instantly" detect patterns on real-time streams of events. However, there is a lack of methods for forecasting …