To better understand the algorithm/parameters etc, I would suggest read these paper:
The original FP Growth algorithm paper, talking about the algorithm/parameters "Mining Frequent Patterns without Candidate Generation" http://www.cs.uiuc.edu/~hanj/pdf/sigmod00.pdf The papallel verion of FP Growth algorhtm, on which Mahout impmlementation is build: "PFP: Parallel FP-Growth for Query Recommendation" infolab.stanford.edu/~echang/recsys08-69.pdf -zhipeng --- On Fri, 11/16/12, Qinghao <[email protected]> wrote: > From: Qinghao <[email protected]> > Subject: Re: Getting started with frequent pattern mining > To: [email protected] > Date: Friday, November 16, 2012, 2:02 AM > Well, this algorithm requires an > input like transaction dataset. > There are some parameters you need to set: > support value (same as FP) > groups (indicates how many groups, into which F-List will be > devided) > You can download some dataset from http://fimi.ua.ac.be/data/ > > Regards, > Q > > > > -- > View this message in context: > http://lucene.472066.n3.nabble.com/Getting-started-with-frequent-pattern-mining-tp4020655p4020663.html > Sent from the Mahout User List mailing list archive at > Nabble.com. >
