Fast Algorithms for Sequence Pattern Recognition in Massive Datasets

Show simple item record

dc.contributor.author D. Gunaseelan
dc.date.accessioned 2019-03-13T04:48:44Z
dc.date.available 2019-03-13T04:48:44Z
dc.date.issued 2008
dc.identifier.issn 1391-586X
dc.identifier.uri http://www.digital.lib.esn.ac.lk/handle/123456789/1880
dc.description.abstract Sequential Pattern Mining is the process of applying data mining techniques to a sequential database for the purpose of discovering the correlation relationships that exist among an ordered list of events. The patterns can be used to focus on the retailing industry, including attached mailing, add-on sales and customer satisfaction. In this vaper, I present fast and efficient algorithms called AprioriAllSID and GSPSID for mining sequential patterns that are fundamentally different from known algorithms like Apriori All and GSP (Generalized Sequential Patterns). The algorithm has been implemented on an experimental basis and its performance studied. The performance study shows that the proposed algorithms have an excellent performance over the best existing algorithms. en_US
dc.language.iso en en_US
dc.publisher Eastern University, Sri Lanka en_US
dc.subject Data Mining, en_US
dc.subject Sequential Pattern Mining, en_US
dc.subject ApriorAllSID algorithm, en_US
dc.subject GSPSID algorithm, en_US
dc.subject Data Sequence. en_US
dc.title Fast Algorithms for Sequence Pattern Recognition in Massive Datasets en_US
dc.type Article en_US
dc.identifier.sslno 5.9 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account