Gets the maximum number of items allowed in a projected database before local processing.
Gets the maximum number of items allowed in a projected database before local processing.
Gets the maximal pattern length (i.
Gets the maximal pattern length (i.e. the length of the longest sequential pattern to consider.
Get the minimal support (i.
Get the minimal support (i.e. the frequency of occurrence before a pattern is considered frequent).
A Java-friendly version of run() that reads sequences from a JavaRDD and returns frequent sequences in a PrefixSpanModel.
A Java-friendly version of run() that reads sequences from a JavaRDD and returns frequent sequences in a PrefixSpanModel.
item type
itemset type, which is an Iterable of Items
sequence type, which is an Iterable of Itemsets
ordered sequences of itemsets stored as Java Iterable of Iterables
a PrefixSpanModel that contains the frequent sequential patterns
Finds the complete set of frequent sequential patterns in the input sequences of itemsets.
Finds the complete set of frequent sequential patterns in the input sequences of itemsets.
sequences of itemsets.
a PrefixSpanModel that contains the frequent patterns
Sets the maximum number of items (including delimiters used in the internal storage format)
allowed in a projected database before local processing (default: 32000000L
).
Sets the maximum number of items (including delimiters used in the internal storage format)
allowed in a projected database before local processing (default: 32000000L
).
Sets maximal pattern length (default: 10
).
Sets maximal pattern length (default: 10
).
Sets the minimal support level (default: 0.1
).
Sets the minimal support level (default: 0.1
).
:: 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 (http://doi.org/10.1109/ICDE.2001.914830).
Sequential Pattern Mining (Wikipedia)