Analyzing the Effectiveness of Apriori and ECLAT Algorithms in Frequent Itemset Mining

Consumer transaction data recorded through the point of sale (POS) system contains purchase patterns that can be used to support marketing strategies. In the context of convenience stores that have high transaction volumes and large product variations, product association analysis is important to uncover customers' shopping habits. This study compares the effectiveness of a priori and ECLAT algorithms in conducting frequent itemset mining on transaction data of daily necessities. Both algorithms were evaluated based on the number of rules generated, support value, confidence, lift, and execution time efficiency. The dataset used is Groceries, which represents actual transactions in the retail environment. The results showed that although a priori and ECLAT produced 25 rules. ECLAT was superior in execution times four times faster than Apriori without compromising the quality of the rules. Most rules have a confidence between 30–50% and a lift above 1.5, signifying a meaningful association. This study concludes that ECLAT is more suitable for use in complex and dynamic minimarket transaction data scenarios, and is recommended as the basis for the development of product recommendation systems and association-based bundling strategies.

Authors

Institutions

Publication Details

Journal
Journal of Computing Innovations and Emerging Technologies
Published
2025-07-11
DOI
https://doi.org/10.64472/jciet.v1i1.4
Citations
1
Primary Topic
Data Mining Algorithms and Applications
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analyzing the Effectiveness of Apriori and ECLAT Algorithms in Frequent Itemset Mining

Dhina Puspasari Wijaya, Pipit Febriana Dewi, Nurul Mega Saraswati
1 citations
Journal of Computing Innovations and Emerging Technologies
Data Mining Algorithms and Applications
3.25
article

Analyzing the Effectiveness of Apriori and ECLAT Algorithms in Frequent Itemset Mining

Dhina Puspasari Wijaya, Pipit Febriana Dewi, Nurul Mega Saraswati
article en
1 citations

Abstract

Consumer transaction data recorded through the point of sale (POS) system contains purchase patterns that can be used to support marketing strategies. In the context of convenience stores that have high transaction volumes and large product variations, product association analysis is important to uncover customers' shopping habits. This study compares the effectiveness of a priori and ECLAT algorithms in conducting frequent itemset mining on transaction data of daily necessities. Both algorithms were evaluated based on the number of rules generated, support value, confidence, lift, and execution time efficiency. The dataset used is Groceries, which represents actual transactions in the retail environment. The results showed that although a priori and ECLAT produced 25 rules. ECLAT was superior in execution times four times faster than Apriori without compromising the quality of the rules. Most rules have a confidence between 30–50% and a lift above 1.5, signifying a meaningful association. This study concludes that ECLAT is more suitable for use in complex and dynamic minimarket transaction data scenarios, and is recommended as the basis for the development of product recommendation systems and association-based bundling strategies.

Journal of Computing Innovations and Emerging TechnologiesVol. 1(1)
Atacama Large Millimeter Submillimeter Array (CL), Universitas Nahdlatul Ulama Indonesia (ID)
Openalex Percentile: Top 7%
Data Mining Algorithms and Applications
3.25
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.