The Data Mining Forum                             open-source data mining software open-source data mining software data science journal data mining conferences
This forum is about data mining, data science and big data: algorithms, source code, datasets, implementations, optimizations, etc. You are welcome to post call for papers, data mining job ads, link to source code of data mining algorithms or anything else related to data mining. The forum is hosted by P. Fournier-Viger. No registration is required to use this forum!.  
FP-Growth algorithm
Posted by: ashish
Date: November 04, 2020 10:15PM

Hello,

How FP-Growth algorithm works. I'm unable to understand the prefix and suffix terms in this algorithm. Let says the database

TID List of items

T100 I1, I2, I5

T200 I2, I4

T300 I2,I3

T400 I1,I2,I4

T500 I1,I3

T600 I2,I3

T700 I1, I3

T800 I1,I2,I3, I5

T900 I1, I2, I3

From the above transaction how FP-Growth finds the frequent itemsets.

Regards

Ashish

Options: ReplyQuote
Re: FP-Growth algorithm
Posted by: ashish
Date: November 04, 2020 10:23PM

The above transaction is of min_sup =2

Options: ReplyQuote
Re: FP-Growth algorithm
Date: November 05, 2020 04:06PM

Hi, explaining the whole algorithm would take a lot of time.

So I recommend to read this chapter from the book of Tan & Kumar:

https://www-users.cs.umn.edu/~kumar001/dmbook/ch5_association_analysis.pdf

It is free to read and has some example about FPGrowth. I think it can help you to understand it.

Options: ReplyQuote


This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.