Efficient Rare Temporal Pattern Mining in Time Series
Van Ho Long, Nguyen Ho, Trinh Le Cong, Anh-Vu Dinh-Duc, Tu Nguyen Ngoc

TL;DR
This paper presents RTPMfTS, an efficient method for mining rare temporal patterns in time series data, addressing computational challenges with optimized algorithms and demonstrating superior performance over baselines.
Contribution
Introduction of RTPMfTS, an end-to-end framework with a novel RTPM algorithm that improves speed and memory efficiency in rare temporal pattern mining.
Findings
RTPMfTS outperforms baseline methods in runtime.
RTPMfTS uses optimized data structures for fast pattern retrieval.
Experimental results show significant memory savings.
Abstract
Time series data from various domains is continuously growing, and extracting and analyzing temporal patterns within these series can provide valuable insights. Temporal pattern mining (TPM) extends traditional pattern mining by incorporating event time intervals into patterns, making them more expressive but also increasing the computational complexity in terms of time and space. One important type of temporal pattern is the rare temporal pattern (RTP), which occurs infrequently but with high confidence. Mining these rare patterns poses several challenges, for example, the low support threshold can lead to a combinatorial explosion and the generation of many irrelevant patterns. To address this, an efficient approach to mine rare temporal patterns is essential. This paper introduces the Rare Temporal Pattern Mining from Time Series (RTPMfTS) method, designed to discover rare temporal…
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.
Taxonomy
TopicsTime Series Analysis and Forecasting · Data Mining Algorithms and Applications · Data Management and Algorithms
