Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.24122 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913064668889088 |
|---|---|
| author | Takahashi, Taihei Takayasu, Kanata Suga, Satoshi Kurihara, Satoshi |
| author_facet | Takahashi, Taihei Takayasu, Kanata Suga, Satoshi Kurihara, Satoshi |
| contents | Accurately extracting patterns that appear frequently only within specific time intervals, together with their dense intervals, is important in many applications such as understanding seasonal demand and detecting anomalous behavior.Frequent itemset mining evaluates support over the entire dataset and therefore cannot detect locally dense patterns. Existing methods for dense pattern mining with interval output estimate dense intervals through occurrence-gap constraints; however, since the gap constraint parameter governs both pattern identification accuracy and interval detection accuracy simultaneously, finding a parameter setting that achieves high accuracy for both objectives is difficult.In this paper, we propose Apriori-window, an exact algorithm that resolves this structural limitation. The proposed method directly evaluates local frequency within a sliding window and thus requires no gap constraint parameter, and it efficiently enumerates dense intervals through anti-monotonicity-based pruning of the search space and stride-skip reduction of the number of window scans. Experiments on three real-world datasets demonstrate that existing methods struggle to simultaneously achieve high accuracy in both pattern identification and dense interval detection, and scalability experiments on synthetic data confirm the practical applicability of the proposed method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_24122 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Exact Mining of Dense Patterns via Direct Evaluation of Local Interval Frequency Using a Sliding Window Takahashi, Taihei Takayasu, Kanata Suga, Satoshi Kurihara, Satoshi Databases H.2.8 Accurately extracting patterns that appear frequently only within specific time intervals, together with their dense intervals, is important in many applications such as understanding seasonal demand and detecting anomalous behavior.Frequent itemset mining evaluates support over the entire dataset and therefore cannot detect locally dense patterns. Existing methods for dense pattern mining with interval output estimate dense intervals through occurrence-gap constraints; however, since the gap constraint parameter governs both pattern identification accuracy and interval detection accuracy simultaneously, finding a parameter setting that achieves high accuracy for both objectives is difficult.In this paper, we propose Apriori-window, an exact algorithm that resolves this structural limitation. The proposed method directly evaluates local frequency within a sliding window and thus requires no gap constraint parameter, and it efficiently enumerates dense intervals through anti-monotonicity-based pruning of the search space and stride-skip reduction of the number of window scans. Experiments on three real-world datasets demonstrate that existing methods struggle to simultaneously achieve high accuracy in both pattern identification and dense interval detection, and scalability experiments on synthetic data confirm the practical applicability of the proposed method. |
| title | Exact Mining of Dense Patterns via Direct Evaluation of Local Interval Frequency Using a Sliding Window |
| topic | Databases H.2.8 |
| url | https://arxiv.org/abs/2604.24122 |