GSP Python implementation
Project description
GSP-python
A Python implementation of Generalized Sequential Patterns (GSP) algorithm for sequential pattern mining
This project implements the Generalized Sequential Patterns (GSP) algorithm to find frequent sequences within a given dataset. This implementation includes parameters for the mingap, maxgap, and maxspan time constraints.
The project also features a simple dataset generator.
Installation
python3 -m pip install gsp_py
Usage
To run the gsp algorithm:
python3 -m gsp-python GSP infile outfile minsup -t maxgap mingap maxspan
To generate a random dataset:
python3 -m gsp-python DatasetGen outfile size nevents maxevents avgelems
For more information about arguments and additional optional arguments, type:
python3 -m gsp-python GSP -h
or
python3 -m gsp-python DatasetGen -h
Alternatively, the modules can be manually imported and used in a script. An example is given below:
from gsp_py.gsp import load_ds
from gsp_py.gsp import GSP
dataset, {}, {} = load_ds("path/to/file.txt")
algo_gsp = GSP(dataset, minsup=0.3, mingap=1, maxgap=2, maxspan=5)
output = algo_gsp.run_gsp()
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
gsp-python-0.0.5.tar.gz
(9.8 kB
view hashes)
Built Distribution
gsp_python-0.0.5-py3-none-any.whl
(10.2 kB
view hashes)
Close
Hashes for gsp_python-0.0.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 4c0ffe1b3e9506a4e53e710b04d9235d56c24dc60efd48014a9143792a3317c3 |
|
MD5 | 376a1f431468ebab6888537d4234814d |
|
BLAKE2b-256 | 1b0aefbb34b619ee5cfe149c884352354fbe4a5757157f1907bf0cb7eabc1cc9 |