An Incremental Interesting Maximal Frequent Itemset Mining Based on FP-Growth Algorithm. (26th July 2022)

• Record Type: Journal Article
• Authors: Alsaeedi, Hussein A.; Alhegami, Ahmed S.
• Other Names: Bueno Atila Academic Editor.
• Is Part Of: Complexity. Volume 2022(2022)
• Publication Date: 2022-07-26
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2022/1942517
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Frequent itemset mining is the most important step of association rule mining. It plays a very important role in incremental data environments. The massive volume of data creates an imminent need to design incremental algorithms for the maximal frequent itemset mining in order to handle incremental data over time. In this study, we propose an incremental maximal frequent itemset mining algorithms that integrate subjective interestingness criterion during the process of mining. The proposed framework is designed to deal with incremental data, which usually come at different times. It extends FP-Max algorithm, which is based on FP-Growth method by pushing interesting measures during maximal frequent itemset mining, and performs dynamic and early pruning to leave uninteresting frequent itemsets in order to avoid uninteresting rule generation. The framework was implemented and tested on public databases, and the results found are promising.