Efficient Discovery of Association Rules in E-Commerce: Comparing Candidate Generation and Pattern Growth Techniques
Applied Sciences · 14.05.2025 · 15 (10) · 5498
DOI: 10.3390/app15105498 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Sciences, online erschienen am 14.05.2025. Verfasst von Ioan Daniel Hunyadi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 15-mal zitiert (Crossref) und nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Lucian Blaga University of Sibiu.
Abstract (Originalsprache)
Association rule mining plays a critical role in uncovering item correlations and hidden patterns within transactional data, particularly in e-commerce environments. Despite the widespread use of Apriori and FP-Growth algorithms, few studies offer a statistically rigorous, tool-based comparison of their performance on real-world e-commerce data. This paper addresses this gap by evaluating both algorithms in terms of execution time, memory consumption, rule generation volume, and rule strength (support, confidence, and lift). Implementations in RapidMiner and an analysis through SPSS establish statistically significant performance differences, particularly under varying support thresholds. Our findings confirm that FP-Growth consistently outperforms Apriori for large-scale datasets due to its ability to bypass candidate generation, while Apriori retains pedagogical and small-scale relevance. The study contributes practical guidance for data scientists and e-commerce practitioners choosing suitable rule-mining techniques based on their data size and performance constraints.
Förderung
- Lucian Blaga University of Sibiu
Zitieren
APA
Hunyadi, I. D., Constantinescu, N., & Țicleanu, O. (2025). Efficient Discovery of Association Rules in E-Commerce: Comparing Candidate Generation and Pattern Growth Techniques. Applied Sciences, 15(10), 5498. https://doi.org/10.3390/app15105498
Vancouver
Hunyadi ID, Constantinescu N, Țicleanu O. Efficient Discovery of Association Rules in E-Commerce: Comparing Candidate Generation and Pattern Growth Techniques. Applied Sciences. 2025;15(10):5498. doi:10.3390/app15105498
BibTeX
@article{Hunyadi2025,
author = {Hunyadi, Ioan Daniel and Constantinescu, Nicolae and Țicleanu, Oana-Adriana},
title = {Efficient Discovery of Association Rules in E-Commerce: Comparing Candidate Generation and Pattern Growth Techniques},
journal = {Applied Sciences},
year = {2025},
volume = {15},
number = {10},
pages = {5498},
doi = {10.3390/app15105498}
}
EUVIMED