This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Sequential Pattern Mining: A Comparison between GSP, SPADE and Prefix SPAN
Authors
Manika Verma, Dr. Devarshi Mehta
Abstract
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).
Keywords- GSP, SPADE, Prefix-Span, Apriori-based, Projection-based
Publication Details
Unique Identification Number - IJEDR1403022Page Number(s) - 3016-3036Pubished in - Volume 2 | Issue 3 | Sept 2014DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Manika Verma, Dr. Devarshi Mehta, "Sequential Pattern Mining: A Comparison between GSP, SPADE and Prefix SPAN", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.2, Issue 3, pp.3016-3036, Sept 2014, Available at :http://www.ijedr.org/papers/IJEDR1403022.pdf
Article Preview
|
|
||||||
|
|
||||||||
