Enhanced parallel mining algorithm for frequent sequential rules

doi:10.1016/j.asej.2021.05.019

Return

Enhanced parallel mining algorithm for frequent sequential rules

2022-01-01

Nesma Youssef *

Hatem Abdul-Kader

Amira Abdelwahab

DOI：10.1016/j.asej.2021.05.019

Original

Save

View PDF

Abstract

En 中文

Sequential rule mining is an important data mining technique that discovers relationships between occurrences of sequential patterns. The main challenge is to avoid time-consuming, especially in large search spaces. This can be achieved through developing an efficient sequential rule mining algorithm without redundancy in a long sequence dataset. In this paper, an algorithm named PNRD-CloGen is pro-posed. It can be used to mine sequential rules from both frequent closed dynamic bit vectors with sequential generator patterns at the same time. It helps in speedily eliminating uninteresting candidates and compact the representations. Additionally, we apply a parallel approach utilizing multi-core archi-tecture. An experimental evaluation was performed using five real sequence datasets: BMSWebView1, Sign, FIFA, Korsarak, and MSNBC. The proposed algorithm has been compared with two non-redundant sequential rule algorithms called: TRuleGrowth, and NRD-DBV algorithm. Experimental results show the time saving, especially for large sequence datasets and low minimum support threshold.(c) 2021 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Ain Shams Uni-versity. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/ by-nc-nd/4.0/).

Keywords:

Non-redundant rule

Multi-core processors

Dynamic bit vector

Closed sequential patterns

Sequential generator patterns

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.