An Event based Prediction Suffix Tree

Evie Andrew, Travis Monk, André van Schaik
10/20/2023
cs.LGcs.NE

No confident code implementation found for this paper.

Abstract

This article introduces the Event based Prediction Suffix Tree (EPST), a biologically inspired, event-based prediction algorithm. The EPST learns a model online based on the statistics of an event based input and can make predictions over multiple overlapping patterns. The EPST uses a representation specific to event based data, defined as a portion of the power set of event subsequences within a short context window. It is explainable, and possesses many promising properties such as fault tolerance, resistance to event noise, as well as the capability for one-shot learning. The computational features of the EPST are examined in a synthetic data prediction task with additive event noise, event jitter, and dropout. The resulting algorithm outputs predicted projections for the near term future of the signal, which may be applied to tasks such as event based anomaly detection or pattern recognition.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{andrew2023event,
  title  = {An Event based Prediction Suffix Tree},
  author = {Evie Andrew and Travis Monk and André van Schaik},
  year   = {2023},
  eprint = {2310.14944},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.14944v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.14944.svg)](https://codeofpaper.com/paper/2310.14944)

Discussion