MapReduce Generic Sequential Pattern Algorithm

Question

I am looking for an example implementation of a generalized sequential pattern (GSP) algorithm http://en.wikipedia.org/wiki/GSP_Algorithm

While the Wikipedia article contains psuedo code, it is a bit confusing, and I would like to see some correct code (ideally python or java). Does anyone know a good link?

I want to understand the algorithm first, and then potentially make it work in the MapReduce world, which, as can be seen from the wikipedia article, uses counters, which I think can be complicated.

I do this because I have an event schedule where the edges are time limited, the sequence will be that the node is connected to another node, where A → B occurs between the beginning and end time and B → C occurs X after the end of B in the first connection. A → B → C will be a sequence, a sequence cannot re-scan a node more than once.

Answer 1

If you need Java code for GSP, PrefixSpan, SPADE, SPAM and many more, check out this website: http://www.philippe-fournier-viger.com/spmf/

Then you can check if you can adapt them to the map reduction algorithm.

Answer 2

SPMF is a good tool that implements many algorithms. This can help us save a lot of time. But we need to compare the performance of various algorithms, such as generalized sequential patterns (GSP), which is an important algorithm for sequential decompression of patterns.