:: Experimental :: A parallel FP-growth algorithm to mine frequent itemsets.
:: Experimental :: Model fitted by FPGrowth.
:: Experimental :: Model fitted by FPGrowth.
:: Experimental :: A parallel PrefixSpan algorithm to mine frequent sequential patterns.
:: Experimental ::
A parallel PrefixSpan algorithm to mine frequent sequential patterns.
The PrefixSpan algorithm is described in J. Pei, et al., PrefixSpan: Mining Sequential Patterns
Efficiently by Prefix-Projected Pattern Growth
(see here).
This class is not yet an Estimator/Transformer, use findFrequentSequentialPatterns
method to
run the PrefixSpan algorithm.
:: Experimental :: A parallel FP-growth algorithm to mine frequent itemsets. The algorithm is described in Li et al., PFP: Parallel FP-Growth for Query Recommendation. PFP distributes computation in such a way that each worker executes an independent group of mining tasks. The FP-Growth algorithm is described in Han et al., Mining frequent patterns without candidate generation. Note null values in the itemsCol column are ignored during fit().
Association rule learning (Wikipedia)