Hierarchical Symbolic Dynamic Filtering of Streaming Non-stationary Time Series Data
Adedotun Akintayo, Soumik Sarkar

TL;DR
This paper introduces a hierarchical symbolic dynamic filtering algorithm for non-stationary streaming time series, effectively modeling complex dynamics and detecting changes without prior knowledge, outperforming existing methods in accuracy and efficiency.
Contribution
It extends Symbolic Dynamic Filtering to handle hierarchical, non-stationary data streams with an online algorithm that detects changes based on data likelihood rate of change.
Findings
High accuracy in feature identification under noisy conditions
Outperforms baseline HDP-HMM in change detection and modeling
Low computational complexity suitable for real-time applications
Abstract
This paper proposes a hierarchical feature extractor for non-stationary streaming time series based on the concept of switching observable Markov chain models. The slow time-scale non-stationary behaviors are considered to be a mixture of quasi-stationary fast time-scale segments that are exhibited by complex dynamical systems. The idea is to model each unique stationary characteristic without a priori knowledge (e.g., number of possible unique characteristics) at a lower logical level, and capture the transitions from one low-level model to another at a higher level. In this context, the concepts in the recently developed Symbolic Dynamic Filtering (SDF) is extended, to build an online algorithm suited for handling quasi-stationary data at a lower level and a non-stationary behavior at a higher level without a priori knowledge. A key observation made in this study is that the rate of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
