资 源 简 介
Introduction
The algorithm PrefixSpan (Prefix-projected Sequential Pattern mining), designed by Pei et al.(1), enumerates frequent sequential patterns from a set of sequences. Frequent means that a sequence occurs in no less than N where N is a threshold.
Download
PrefixSpan is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License.
PrefixSpan is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See GNU General Public License for more details.
Installation
Requirements
C++ compiler with STL (Standard Template Library)
### How to install ###
tar -xjvf prefinxspanX.X.tar.gz2cd prefixspanX.Xmake
Usage
./prefixspan [options] input-dataoption: -min_sup INTEGER : set minimum support (default: 1) -max_pat INTEGER :
