4

I am looking for an example implementation of the Generalized Sequential Pattern algorithm (GSP) http://en.wikipedia.org/wiki/GSP_Algorithm

Whilst the Wikipedia article provides psuedo code, its a bit confusing and I would like to see some proper code (ideally python or java). Does anyone know a good reference?

I want to understand the algorithm first and then potentially make it work in a MapReduce world - which as the wikipedia article shows the use of counters I think could be complex.

I am doing this because I have a graph of events where the edges are constrained by time, a sequence would be where a node is connected to another node where A -> B happens between a start and a finish time and B -> C happens X time after B finishes in the first connection. A -> B -> C would be the sequence, a sequence can't revisit a node more than once.

4

2 に答える 2

1

SPMFは、多くのアルゴリズムを実装する優れたツールです。それは私たちが多くの時間を節約するのに役立ちます。ただし、シーケンシャルパターンマイニングの重要なアルゴリズムであるGeneralized Sequential Patterns（GSP）などのさまざまなアルゴリズムのパフォーマンスを比較する必要があります。

于 2013-03-14T11:00:10.917 に答える
1

GSP、PrefixSpan、SPADE、SPAMなどのJava コードが必要な場合は、次の Web サイトを確認してください: http://www.philippe-fournier-viger.com/spmf/

次に、それらを map-reduce アルゴリズムに適応できるかどうかを確認できます。

于 2012-04-26T04:08:51.583 に答える