Re: Gc-Growth algorithm
Date: January 22, 2015 06:32PM
I think that I answered your e-mail about it already. But I will share the answer here too.
If you mean that it finds frequent closed itemsets and frequent generator itemsets at the same time, then the answer is yes. However, it is based on Apriori and it is thus not a very efficient algorithm. GcGrowth must be faster since based on FPGrowth but i did not check the details of that paper.