A very efficient top-k sequential pattern miner.
Developed using C#, and tested under Windows, OS X (w/ Mono), and Linux (w/ Mono).
Run without any argument to show help.
- Mining top-k sequence patterns (w/ or w/o gap) from text or any sequential data.
- Supports stop-words.
- Supports minimum and maximum pattern length constraints.
- With corresponding pattern search space pruning.
- Based on state-of-the-art PrefixSpan algorithm.
- Integrated with top-k mining optimization.