sequenceminer
sequenceminer copied to clipboard
shahin
An implementation of the SPADE sequence mining algorithm in Python.
The package and README don't contain full-fledged examples. Add examples to make the use and operation of sequenceminer clear to a new user.
Related to #6. Currently, all sequences of a given size are submitted to enumerate_frequent_seq(). This is slow and memory intensive. Memory requirements can be reduced in SPADE using a depth-first...
Currently, all intermediate and temporary results continue to reside in memory until the program completes. This negates the benefit of depth-first search over the sequence lattice, which should require relatively...