fp growth algorithm

I have to implement FP-growth algorithm using any language. The code should be a serial code with no recursion. Is it possible to implement such algorithm without recursion? I am not looking for cod开发者_如何学Goe, I just need an explanation of how to do it.

FPGrowth is a recursive algorithm. Like some other people said here, you can always transform an algorithm into a non recursive algorithm by using a stack. But I don't see any good reasons to do that for FPGrowth.

By the way, if you want a Java implementation of FPGrowth and other frequent pattern mining algorithms such as Apriori, HMine, Eclat, etc., you can check my website. I have implemented more than 40 algorithms for frequent pattern mining, association rule mining, etc.:

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

I don't know what is the algorithm you talking about. But everyting what is possible with recursion it is possible also without it. You can implement such kind of algorithms using stack.

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

Assuming by "FP growth Algorithm" you mean frequent Pattern growth algorithm, I would point you over to this document that gives a decent explanation on how it works.

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

I wonder though, is this homework related?

You can probably visit http://code.google.com/p/lofia/ to get something over FP Tree. This is for longest frequent itemset mining.

You can take look at the concept & implemenntation FP growth algoithm in Mahout