A parallel PrefixSpan algorithm to mine frequent sequential patterns.
The PrefixSpan algorithm is described in Jian Pei et al (2001) 
New in version 1.6.0.
Jian Pei et al.,
“PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth,”
Proceedings 17th International Conference on Data Engineering, Heidelberg,
Germany, 2001, pp. 215-224,
train(data[, minSupport, maxPatternLength, …])
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.
The input data set, each element contains a sequence of
The minimal support level of the sequential pattern, any
pattern that appears more than (minSupport *
size-of-the-dataset) times will be output.
The maximal length of the sequential pattern, any pattern
that appears less than maxPatternLength will be output.
The maximum number of items (including delimiters used in the
internal storage format) allowed in a projected database before
local processing. If a projected database exceeds this size,
another iteration of distributed prefix growth is run.