2022
DOI: 10.2139/ssrn.4113695
|View full text |Cite
|
Sign up to set email alerts
|

Apriori Algorithm against Fp Growth Algorithm: A Comparative Study of Data Mining Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…The frequent pattern growth (FP-Growth) algorithm is an improved version of the Apriori algorithm [44]. It is an alternative method for finding frequent item-sets without using candidate generations [45], by employing a divide-and-conquer strategy.…”
Section: − Fp-growth Algorithmmentioning
confidence: 99%
“…The frequent pattern growth (FP-Growth) algorithm is an improved version of the Apriori algorithm [44]. It is an alternative method for finding frequent item-sets without using candidate generations [45], by employing a divide-and-conquer strategy.…”
Section: − Fp-growth Algorithmmentioning
confidence: 99%
“…It is capable of extracting the products through the utilization of lift, leverage, and conviction, provided that a minimum threshold is set. [34] FP Growth identifies the set of most frequent items without requiring candidate generation. It is divided into two stages: The FP-Tree, a compact data structure, is generated in step one, and the frequent item sets are extracted directly from the FP-Tree in step two.…”
Section: Fp Growth Algorithmmentioning
confidence: 99%
“…All overlapping item sets share the same prefix path, which is the main advantage of the FP-Tree. As a result, the information in the data set is significantly compressed [9].  Pass1: It searches the data initially before locating evidence for each item.…”
Section: Fp-growthmentioning
confidence: 99%