Re: Mining Frequent Itemsets from Secondary Memory
Posted by:
Marcel Schulze
Date: November 03, 2013 08:28AM
Hi again,
Thanks for your quick response.
I read the second paper before. I also took a look at the first paper. Those are exactly what I'm looking for. However, I didn't understand the partitioning and merging method. Therefore, I didn't find a way to implement those algorithms.
For instance, if we have a database with 100,000,000 transactions, can we simply divide it into 1000 databases each with 100,000 transactions? If so, how can we merge the processed partitions (sub-databases) to generate frequent itemsets?
I have also found two similar algorithms. The first one is SaM (Split and Merge) by Dr. Borgelt and the second is A-Priori using divide and conquer method. But I have the same problem with these two.
I would appreciate your support and guidance in this issue.
Best Regards,
Marcel Schulze