An Incremental Interesting Maximal Frequent Itemset Mining Based on FP‐Growth Algorithm
Open Access
- 1 January 2022
- journal article
- research article
- Published by Wiley in Complexity
- Vol. 2022 (1)
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.Keywords
This publication has 45 references indexed in Scilit:
- Maximal Pattern Mining Using Fast CP-Tree for Knowledge DiscoveryInternational Journal of Information Systems and Social Change, 2012
- The Pre-FUFP algorithm for incremental miningExpert Systems with Applications, 2009
- Maintenance of fast updated frequent pattern trees for record deletionComputational Statistics & Data Analysis, 2009
- PADS: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern miningKnowledge and Information Systems, 2008
- Incrementally fast updated frequent pattern trees☆Expert Systems with Applications, 2008
- GenMax: An Efficient Algorithm for Mining Maximal Frequent ItemsetsData Mining and Knowledge Discovery, 2005
- Analyzing the subjective interestingness of association rulesIEEE Intelligent Systems and their Applications, 2000
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000
- Unexpectedness as a measure of interestingness in knowledge discoveryDecision Support Systems, 1999
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993