arrow
返回

HANP-Miner: High average utility nonoverlapping sequential pattern mining

delete2021-10-01
delete32
PRE
AI
武
武优西 (Youxi Wu)
M
Meng Geng
Y
Yan Li *
L
Lei Guo
Z
Zhao Li
P
Philippe Fournier‐Viger
X
Xingquan Zhu
X
Xindong Wu
DOI:10.1016/j.knosys.2021.107361delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Nonoverlapping sequential pattern mining (SPM) is a data analysis task, which aims at identifying repetitive sequential patterns with gap constraint in a set of discrete sequences. Nonoverlapping means that any character in the sequence can be rematched by characters at different positions in the pattern, while overlapping means that any character can be reused at the same position, which can be regarded as no condition. Compared with overlapping SPM, nonoverlapping SPM has more strict constraint on the occurrences of pattern, and meets the Apriori property. However, current algorithms mine frequent or closed patterns, resulting in some low-frequency but extremely important patterns being ignored. To tackle this issue, this paper proposes to mine high average utility nonoverlapping sequential patterns (HANP). An efficient algorithm called HANP-Miner is proposed, which involves two key steps: support calculation and candidate pattern reduction. To calculate the support (the occurrence frequency of a pattern), depth-first search and backtracking strategies based on the simplified Nettree structure are adopted, an approach that effectively reduces the time and space complexities of the algorithm. To effectively reduce the number of candidate patterns, a pattern join strategy based on an upper bound on the average utility is proposed. Experiments on biological sequences and real sales sequences are carried out to verify the efficiency of HANP-Miner and the superiority of HANPs. The results demonstrate that HANP-Miner is not only more efficient, but that the HANPs mined in this way are also more valuable than existing frequent patterns. The algorithms and datasets can be downloaded from https://github.com/wuc567/Pattern-Mining/tree/master/HANP-Miner. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Sequential pattern mining
High average utility
Depth-first search
Pattern join

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

H
harbin institute of technology
学者数:
8.0W
论文数: 6.6W
被引数: 66
H
hefei university of technology
学者数:
2.5W
论文数: 1.7W
被引数: 35
State University System of Florida 封面图
State University System of Florida
学者数:
12.8W
论文数: 10.9W
被引数: 130
F
Florida Atlantic University
学者数:
3.2K
论文数: 2.5K
被引数: 4.8K
H
hebei university of technology
学者数:
1.8W
论文数: 1.2W
被引数: 10
学者 查看更多机构
引用论文

引用论文

Strict pattern matching under non-overlapping condition
err2016-11-15
err39
PREAI
errWu, Youxi; Shen, Cong; Jiang, He; Wu, Xindong
err分享
err收藏
err分享
err收藏
err分享
err收藏
Mining cost-effective patterns in event logs
err2020-03-01
err31
PREAI
errFournier-Viger, Philippe; Li, Jiaxuan; Lin, Jerry Chun-Wei; Tin Truong Chi; Kiran, R. Uday
err分享
err收藏
学者 查看更多内容