Thanks for the help Tom :-)
On Sun, Feb 26, 2012 at 11:56 PM, tom wrote:
> It's not well documented, but there are actually two distinct
> implementations of FPGrowth, which each can be run sequentially or as
> mapreduce jobs.
>
> The --method option lets you select sequential/mapreduce, and the
It's not well documented, but there are actually two distinct
implementations of FPGrowth, which each can be run sequentially or as
mapreduce jobs.
The --method option lets you select sequential/mapreduce, and the
--useFPG2/-2 flag selects the alternate implementation.
Any way you run FPG, p
Hi Tom,
I don't understand, why do you say I will get a lot of redundant patterns?
In each group dependent shard generates patterns with respect to the
elements of that shard. The fpg-2 as far as I know and if I am correct is
only a new sequential implementation of fp-growth and not map/reduce
imp
Hi Gaurav,
The patterns are accumulated in a heap (see FrequentPatternMaxHeap),
which uses isSubPatternOf.
That said, I do think the default implementation of PFPGrowth will get
you many redundant patterns under certain circumstances, but the "-2"
implementation will reduce (perhaps eliminat
