The Data Mining Forum                             open-source data mining software data science journal data mining conferences high utility mining workshop
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!.  
Does it include these ?
Posted by: Ruhallah Ahmadian
Date: December 01, 2018 02:48PM

I'm looking for these algorithm, are there these in SPMF ?
Apriori with Transaction reduction
Apriori with Partitioning
Apriori with Sampling
Apriori with Dynamic itemset counting
Vertical Data Format

Options: ReplyQuote
Re: Does it include these ?
Date: December 02, 2018 03:53PM

Hello,

Ruhallah Ahmadian Wrote:
-------------------------------------------------------
> I'm looking for these algorithm, are there these
> in SPMF ?
> Apriori with Transaction reduction

No.

> Apriori with Partitioning

No.

> Apriori with Sampling

No.

> Apriori with Dynamic itemset counting

No.

> Vertical Data Format

Yes, several algorithms in SPMF use a vertical data format such as AprioriTID, Eclat, Charm, etc.

In SPMF there are four main versions of Apriori:
- Apriori
- AprioriTID (using the vertical format)
- AprioriTIDbitset (using the vertical format, implemented as bitvectors)
- AprioriHT (optimized using a Hash tree structure

By the way, there are some algorithms that are faster than Apriori such as FPGrowth, which are also implemented in SPMF. This is why, I did not implement too much optimizations for Apriori. Even if Apriori is optimized, it will always be slower than algorithms like FPGrowth.

Best regards,



Edited 1 time(s). Last edit at 12/02/2018 04:00PM by webmasterphilfv.

Options: ReplyQuote


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