UCSY's Research Repository

Implementation of Sequential Pattern Mining with Item Intervals

Show simple item record

dc.contributor.author Kyaw, Kay Zar
dc.contributor.author Hla, Ni Ni
dc.date.accessioned 2019-08-05T00:58:09Z
dc.date.available 2019-08-05T00:58:09Z
dc.date.issued 2009-12-30
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1719
dc.description.abstract Sequential Pattern mining is an important data mining field with wide range of applications that can extract frequent sequences while maintaining their order. It is important to identify item intervals of sequential patterns extracted by sequential pattern mining. There are two approaches for integration of item intervals with sequential pattern mining; constraint-based mining and extended sequence-based mining. This paper presents the combination of those two item interval approaches. PrefixSpan algorithm is used to find the frequent sequence patterns from the sequence database. PrefixSpan algorithm overcomes the problems of Apriori-based algorithms since it avoids the candidate generation and multiple database scanning time. Moreover, prefix-projectiong substantially reducest the size of projected databases and leads to efficient processing. en_US
dc.language.iso en en_US
dc.publisher Fourth Local Conference on Parallel and Soft Computing en_US
dc.subject Data Mining en_US
dc.subject Web Mining en_US
dc.subject Frequent Patterns en_US
dc.subject Sequential Pattern en_US
dc.subject Apriori en_US
dc.subject AprioriAll en_US
dc.subject PrefixSpan en_US
dc.subject Pattern Growth Method en_US
dc.title Implementation of Sequential Pattern Mining with Item Intervals en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account

Statistics