Complete Closed Time Intervals-Related Patterns Mining
Omer David Harel, Robert Moskovitch
Abstract
Using temporal abstraction, various forms of sampled multivariate temporal data can be transformed into a uniform representation of symbolic time intervals, from which Time Intervals Related Patterns (TIRPs) can be then discovered. Hence, mining TIRPs from symbolic time intervals offers a comprehensive framework for heterogeneous multivariate temporal data analysis. While the field of time intervals mining has gained a growing interest in recent decades, frequent closed TIRPs mining was not investigated in its full complexity. Mining frequent closed TIRPs is highly effective due to the discovery of a compact set of frequent TIRPs, which contains the complete information of all the frequent TIRPs. However, as we demonstrate in this paper, the recent advancements made in closed TIRPs discovery are incomplete, due to the discovery of only the first instances of the TIRPs within each STIs series in the database. In this paper we introduce the TIRPClo algorithm – for complete and efficient mining of frequent closed TIRPs. The algorithm utilizes a memory-efficient index and a novel method for data projection, due to which it is the first algorithm to guarantee a complete discovery of frequent closed TIRPs. In addition, a rigorous runtime comparison of TIRPClo to state-of-the-art methods is performed, demonstrating a significant speed-up on various real-world datasets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3fc61b62-7c3a-4662-9cef-1a49dc1b969fRelated papers
- BITIRP - Efficient Time Intervals-Related Pattern MiningLidor Prager, Robert MoskovitchKDD 2026
- Efficient Temporal Pattern Mining in Big Time Series Using Mutual InformationVan Long Ho, Nguyen Ho, Torben Bach PedersenVLDB 2022 · 17 citations
- Z-Miner: An Efficient Method for Mining Frequent Arrangements of Event IntervalsZed Lee, Tony Lindgren, Panagiotis PapapetrouKDD 2020 · 22 citations
- Mining Top-k Pairs of Correlated Subgraphs in a Large NetworkArneish Prateek, Arijit Khan, Akshit Goyal, Sayan RanuVLDB 2020 · 13 citations
- DCDiscover: Mining Threshold Denial Constraints from Time Series DataXiaoou Ding, Muyun Zhou, Yida Liu, Zekai Qian et al.ICDE 2025 · 1 citation
