An Efficient Algorithm to Discover Intra-Periodic Frequent Sequences
Year: 2020
Type: conference-paper
Abstract: Sequential pattern mining techniques permit to discover recurring structures or patterns from very large datasets, with a very large field of applications. It aims at extracting a set of attributes, shared across time among a large number of objects in a given database. It is a challenging problem since mining algorithms are well known to be both time and memory consuming for large databases. In this paper, we extend the traditional problem of mining frequent sequences with intra-periodicity constraints. Then, we study issues related to intra-periodicity constraints such as search space pruning and partitioning. This study leads to a new efficient algorithm called Intra-Periodic Frequent Sequence Miner (IPFSM). Experimental results confirm the efficiency of IPFSM.
Source: HAL
Institution: Université de Dschang
Language: French
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3161925375