Recency-based sequential pattern mining in multiple event sequences

Citations

WEB OF SCIENCE

11
Citations

SCOPUS

11

초록

The standard sequential pattern mining scheme hardly considers the positions of events in a sequence, and therefore it is difficult to focus on more interesting patterns that represent better the causal relationships between events. Without quantifying how close two events are in a sequence, we may fail to evaluate how likely an event is caused by the others from the pattern, which is a severe drawback for some applications like prediction. Motivated by this, we propose therecency-based sequential pattern miningscheme together with a novel measure of pattern interestingness to effectively capture recency as well asfrequency. To efficiently extract all the recency-based sequential patterns, we devise a mining algorithm, calledRecency-basedFrequent patternMiner(RF-Miner), together with an effective prediction method to evaluate the quality of recency-based patterns in terms of their prediction power. The experimental results show that ourRF-Mineralgorithm can extract more diverse and important patterns that can be used to make prediction of the next event, and can be more efficiently performed by using the upper bounds of our measure than baseline algorithms.

키워드

Data miningSequential pattern miningWeb clickstream analysis
제목
Recency-based sequential pattern mining in multiple event sequences
저자
Kim, HakkyuChoi, Dong-Wan
DOI
10.1007/s10618-020-00715-7
발행일
2021-01
유형
Article
저널명
Data Mining and Knowledge Discovery
35
1
페이지
127 ~ 157