Efficient Closed Frequent Itemset Mining: Enhancing Association Rule Discovery with Vertical Format Algorithms

Frequent Itemset (FIS) mining has traditionally involved redundant data, but the shift to mining ClosedFIS(CFIS) has mitigated this issue. Despite this improvement, performance challenges such as processing time and storage space persist. New algorithms for CFIShave been introduced, and research in Association Rule Mining (ARM) remains active, mainly focusing on efficient itemset discovery and rule optimization. This has led to well-established algorithms, including Apriori, Apriori-Tid, H-Mine algorithms but this research concentrated on vertical format algorithms because of Apriori property exploitation for generating candidate itemsets. This paper shows that mining all FIS initially isn't necessary; instead, focusing on CFIS, which are significantly fewer, is sufficient. It also eliminates the need to mine every possible rule, as any rule between itemsets can be represented by a rule among closed itemsets. The equivalence class transformation algorithm focuses on identifying frequent items within transaction groups, operating exclusively on a vertical database layout to minimize redundant rules. Additionally, the Improved Closed Association Rule Mining (ICHARM) method is introduced as an efficient method for extracting all closed frequent itemsets. Experimental results demonstrate that this approach can significantly enhance sales strategy development.

Authors

Institutions

Publication Details

Published
2025-03-27
DOI
https://doi.org/10.1109/icfts62006.2025.11031948
Primary Topic
Data Mining Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Closed Frequent Itemset Mining: Enhancing Association Rule Discovery with Vertical Format Algorithms

S. Silvia Priscila, A. Ashraf Ali
Data Mining Algorithms and Applications
article

Efficient Closed Frequent Itemset Mining: Enhancing Association Rule Discovery with Vertical Format Algorithms

S. Silvia Priscila, A. Ashraf Ali
article en

Abstract

Frequent Itemset (FIS) mining has traditionally involved redundant data, but the shift to mining ClosedFIS(CFIS) has mitigated this issue. Despite this improvement, performance challenges such as processing time and storage space persist. New algorithms for CFIShave been introduced, and research in Association Rule Mining (ARM) remains active, mainly focusing on efficient itemset discovery and rule optimization. This has led to well-established algorithms, including Apriori, Apriori-Tid, H-Mine algorithms but this research concentrated on vertical format algorithms because of Apriori property exploitation for generating candidate itemsets. This paper shows that mining all FIS initially isn't necessary; instead, focusing on CFIS, which are significantly fewer, is sufficient. It also eliminates the need to mine every possible rule, as any rule between itemsets can be represented by a rule among closed itemsets. The equivalence class transformation algorithm focuses on identifying frequent items within transaction groups, operating exclusively on a vertical database layout to minimize redundant rules. Additionally, the Improved Closed Association Rule Mining (ICHARM) method is introduced as an efficient method for extracting all closed frequent itemsets. Experimental results demonstrate that this approach can significantly enhance sales strategy development.

Bharath University (IN)
Openalex Percentile: Top 80%
Data Mining Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.