Towards fast and memory efficient discovery of periodic frequent patterns
Periodic frequent pattern (PFP) mining, the process of discovering frequent patterns that occur at regular periods in databases, is an important data mining task for various decision-making. Although several algorithms have been proposed for discovering PFPs, most of these algorithms often employ a...
Main Authors: | Vincent Mwintieru Nofong, John Wondoh |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-10-01
|
Series: | Journal of Information and Telecommunication |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/24751839.2019.1634868 |
Similar Items
-
Efficient Mining of Non-Redundant Periodic Frequent Patterns
by: Michael Kofi Afriyie, et al.
Published: (2021-11-01) -
TKIFRPM: A Novel Approach for Topmost-K Identical Frequent Regular Patterns Mining from Incremental Datasets
by: Saif Ur Rehman, et al.
Published: (2023-01-01) -
An Optimization of Closed Frequent Subgraph Mining Algorithm
by: Demetrovics J., et al.
Published: (2017-03-01) -
Frequent-pattern discovering algorithm for large-scale corpus
by: GONG Cai-chun1, et al.
Published: (2007-01-01) -
Frequent-pattern discovering algorithm for large-scale corpus
by: GONG Cai-chun1, et al.
Published: (2007-01-01)