Fp growth algorithm

Question

I have to implement FP growth algorithm in any language. The code must be serial code without recursion. Is it possible to implement such an algorithm without recursion? I'm not looking for code, I just need an explanation on how to do this.

Answer 1

FPGrowth is a recursive algorithm. Like some of the other people mentioned here, you can always convert an algorithm to a non-recursive algorithm using the stack. But I see no good reason for this for FPGrowth.

By the way, if you want to implement the Java implementation of FPGrowth and other commonly used template development algorithms such as Apriori, HMine, Eclat, etc., you can check out my site. I have implemented more than 40 algorithms for frequent template development, rule rule development, etc.:

http://www.philippe-fournier-viger.com/spmf/

Answer 2

I do not know what algorithm you are talking about. But everything that is possible with recursion is possible without it. You can implement such algorithms using the stack.

Answer 3

Here is a very clear explanation of how the code works. It looks like you need to build a tree and test it.

Answer 4

Assuming an "FP growth algorithm", you mean a frequent template growth algorithm, I would point you to this document, which gives a worthy explanation of how it works.

http://www.florian.verhein.com/teaching/2008-01-09/fp-growth-presentation_v1%20%28handout%29.pdf

I wonder if this is homework?

Answer 5

You can visit http://code.google.com/p/lofia/ to get something above the FP tree. This is the longest frequent mining.

Answer 6

You can take a look at the concept and implement FP growth alphaism in Mahout