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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Trustworthy Prediction with Gaussian Process Knowledge Scores
Conformation-Aware Structure Prediction of Antigen-Recognizing Immune Proteins
Towards High-Resolution 3D Anomaly Detection: A Scalable Dataset and Real-Time Framework for Subtle Industrial Defects
Evaluating Language Models For Threat Detection in IoT Security Logs
Cautious Next Token Prediction
Where, What, Why: Towards Explainable Driver Attention Prediction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.