An Event based Prediction Suffix Tree
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Anomaly DetectionOne-Shot LearningPredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
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 …
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…
PredictionLearning 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…
A Deep Adversarial Model for Suffix and Remaining Time Prediction of Event Sequences
Event suffix and remaining time prediction are sequence to sequence learning tasks. They have wide applications in different areas such as economics, digital health, business process management and IT infrastructure moni…
DecoderManagementPredictionSuffix 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…
Information RetrievalLanguage ModelingLanguage ModellingMachine Translation+2