Why FP-growth approach is considered better than Apriori approach? Explain./How FP tree is better than Apriori Algorithm?

 Apriori Algorithm :

It is a classic algorithm for learning association rules.

It uses a bottom-up approach where frequent subsets are extended one at a time.

It uses a Breadth-first search and hash tree structure to count candidate item sets efficiently.


FP Growth:

It allows frequent itemset discovery without candidate generation.

It builds a compact data structure called FP tree with two passes over the database.

It extracts frequent itemsets directly from the FP tree and traverses through the FP tree.



Comments

Popular posts from this blog

Discuss classification or taxonomy of virtualization at different levels.

What is the cloud cube model? Explain in context to the Jericho cloud cube model along with its various dimensions.

Explain cloud computing reference model .