Papers › Real Time Pattern Matching with Dynamic Normalization
Real Time Pattern Matching with Dynamic Normalization
Renzhi Wu, Sergey Sukhanov, Christian Debes
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Pattern matching in time series data streams is considered to be an essential data mining problem that still stays challenging for many practical scenarios. Different factors such as noise, varying amplitude scale or shift, signal stretches or shrinks in time are all leading to performance degradation of many existing pattern matching algorithms. In this paper, we introduce a dynamic z-normalization mechanism allowing for proper signal scaling even under significant time and amplitude distortions. Based on that, we further propose a Dynamic Time Warping-based real-time pattern matching method to recover hidden patterns that can be distorted in both time and amplitude. We evaluate our proposed method on synthetic and real-world scenarios under realistic conditions demonstrating its high operational characteristics comparing to other state-of-the-art pattern matching methods.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections