UPER: Efficient Utility-driven Partially-ordered Episode Rule Mining
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912912699817984 |
|---|---|
| author | Lin, Hong Gan, Wensheng Ren, Junyu Yu, Philip S. |
| author_facet | Lin, Hong Gan, Wensheng Ren, Junyu Yu, Philip S. |
| contents | Episode mining is a fundamental problem in analyzing a sequence of numerous events. For discovering strong relationships between events in a complex event sequence, episode rule mining is proposed. However, both the episode and episode rules have strict requirements for the order of events. Hence, partially-ordered episode rule mining (POERM) is designed to loosen the constraints on the ordering, i.e., events in the antecedents and consequents of the rule can be unordered, and POERM has been applied to real-life event prediction. In this paper, we consider the utility of POERM, intending to discover more valuable rules. We define the utility of POERs and propose an algorithm called UPER to discover high-utility partially-ordered episode rules. In addition, we adopt a data structure named NoList to store the necessary information, analyze the expansion of POERs in detail, and propose several pruning strategies (namely WEUP, REUCSP, and REEUP) to reduce the number of candidate rules. Finally, we conduct experiments on several datasets to demonstrate the effectivene |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_16718 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | UPER: Efficient Utility-driven Partially-ordered Episode Rule Mining Lin, Hong Gan, Wensheng Ren, Junyu Yu, Philip S. Databases Episode mining is a fundamental problem in analyzing a sequence of numerous events. For discovering strong relationships between events in a complex event sequence, episode rule mining is proposed. However, both the episode and episode rules have strict requirements for the order of events. Hence, partially-ordered episode rule mining (POERM) is designed to loosen the constraints on the ordering, i.e., events in the antecedents and consequents of the rule can be unordered, and POERM has been applied to real-life event prediction. In this paper, we consider the utility of POERM, intending to discover more valuable rules. We define the utility of POERs and propose an algorithm called UPER to discover high-utility partially-ordered episode rules. In addition, we adopt a data structure named NoList to store the necessary information, analyze the expansion of POERs in detail, and propose several pruning strategies (namely WEUP, REUCSP, and REEUP) to reduce the number of candidate rules. Finally, we conduct experiments on several datasets to demonstrate the effectivene |
| title | UPER: Efficient Utility-driven Partially-ordered Episode Rule Mining |
| topic | Databases |
| url | https://arxiv.org/abs/2602.16718 |