A pattern-growth approach for mining maximal fault-tolerant frequent itemsets
Author:
Open Access
- 23 March 2026
- journal article
- research article
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Abstract
Mining fault-tolerant (FT) frequent itemsets in noisy datasets is more challenging than conventional frequent itemset mining due to the high cost of evaluating fault-tolerance conditions. Consequently, mining maximal fault-tolerant frequent itemsets (FT-MFIs) is particularly important, as they provide a concise representation of all frequent patterns while eliminating redundancy, which is crucial in noisy datasets where error tolerance must be considered. Existing approaches for mining FT-MFIs are predominantly based on Apriori-style candidate generation and test, which suffer from exponential candidate growth, multiple dataset scans, and limited scalability. As a novel contribution, this work is the first to propose a pattern-growth framework for mining FT-MFIs. We introduce an algorithm that constructs a fault-tolerant FP-tree (FT-FP-tree) to compress transactions with common prefixes and evaluate tolerance conditions in a single pass. Additionally, new techniques for transaction mapping and conditional pattern extraction enhance the efficiency and scalability of the mining process. Experimental results on benchmark datasets demonstrate that the proposed approach achieves substantial reductions in execution time compared to all existing algorithms, while also showing improved memory efficiency relative to other pattern-growth based algorithms. This establishes pattern growth as a practical and scalable solution for fault-tolerant frequent itemset discovery.Keywords
Funding Information
- Imam Mohammed Ibn Saud Islamic University (IMSIU-DDRSP2603)
This publication has 56 references indexed in Scilit:
- An Enhanced FP-Growth Algorithm with Hybrid Adaptive Support Threshold for Association Rule Mining2025
- Efficient Frequent Subgraph Mining: Algorithms and Applications in Complex Networks2025
- Market Basket Analysis Using Apriori and Eclat Algorithm in an E-Commerce Company2025
- B-mine: Frequent Pattern Mining and Its Application to Knowledge Discovery from Social Networks2016
- Top-K Miner: top-K identical frequent itemsets discovery without user support thresholdKnowledge and Information Systems, 2015
- Pattern-Growth Methods2014
- On Mining Proportional Fault-Tolerant Frequent ItemsetsLecture Notes in Computer Science, 2014
- Approximate Frequent Itemset Mining In the Presence of Random Noise2008
- Max-FTP: Mining Maximal Fault-Tolerant Frequent Patterns from DatabasesLecture Notes in Computer Science, 2007
- An Efficient Approach for Mining Fault-Tolerant Frequent Patterns Based on Bit Vector RepresentationsLecture Notes in Computer Science, 2005