Sequential Pattern Mining: A Comparison between GSP, SPADE and Prefix SPAN
- Manika Verma
- Dr. Devarshi Mehta
GSP, SPADE, Prefix-Span, Apriori-based, Projection-based
This paper presents a comparison between basically three kinds of algorithm GSP (Generalized Sequential Pattern), SPADE (An efficient Algorithm for mining Frequent Sequences) and Prefix Span (Prefix-projected Sequential Pattern Mining). GSP is the Apriori based Horizontal formatting method, SPADE is the Apriori based vertical formatting method and Prefix-SPAN is Projection-based pattern growth method. This paper elaborate step wise explanation of each algorithm demonstrating number of iterations required in each algorithm. Later a comparison is made between Total time required to execute algorithm, count of frequent sequences found and Max memory (in mb) required by algorithms GSP, SPADE and Prefix-SPAN. The above stated attributes i.e. total time; frequent sequences and Max Memory are obtained using SPMF (A sequential Pattern Mining Framework).
Manika Verma, Dr. Devarshi Mehta. "Sequential Pattern Mining: A Comparison between GSP, SPADE and Prefix SPAN".INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH ISSN:2321-9939, Vol.2, Issue 3, pp.3016-3036, URL :https://rjwave.org/ijedr/papers/IJEDR1403022.pdf
Volume 2 Issue 3
Pages. 3016-3036
