The Data Mining Forum                             open-source data mining software data mining conferences Data Science for Social and Behavioral Analytics DSSBA 2022 data science journal
IMPORTANT: This is the old Data Mining forum.
I keep it online so that you can read the old messages.

Please post your new messages in the new forum: https://forum2.philippe-fournier-viger.com/index.php
 
Implementation of Gc-Growth algorithm?
Posted by: Asmaa
Date: January 21, 2015 08:24PM

please I need implemntation of Gc_Growth algorithm for mines both generators itemsets and closed itemsets from relational data

thanks in advance




Edited 3 time(s). Last edit at 01/22/2015 08:16AM by webmasterphilfv.

Options: ReplyQuote
Re: Gc-Growth algorithm
Date: January 22, 2015 03:51AM

Personally, I don't have time to implement it for you. But there is an algorithm called Zart in SPMF that finds generators and closed itemsets at the same time. It could be used as a replacement perhaps. Or maybe that someone else has code for GcGrowth

Options: ReplyQuote
Re: Gc-Growth algorithm
Posted by: Asmaa
Date: January 22, 2015 10:04AM

Is Zart algorithm finds generators and closed item sets in one iteration on the data because i deal with large and incremental data set

Options: ReplyQuote
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.

Options: ReplyQuote
Re: Implementation of Gc-Growth algorithm?
Posted by: Asmaa
Date: January 24, 2015 05:29AM

thanks alot

Options: ReplyQuote


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