Sequential Pattern Mining (SPM) for user-inputted data sets: an empirical framework using bitwise operations Online publication date: Wed, 06-Jan-2016
by M. Manohar; R. Dinesh; M.S. Sowmya
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 3, No. 3/4, 2015
Abstract: Sequential pattern mining is used to discover temporal relationships between item sets within a large data set. The downside of these approaches is the computation time and memory requirement, which increase exponentially with the data set size. We propose a new algorithm for sequential pattern mining using Apriori-based frequent itemset. In this work, a whole transaction is represented using binary number. The main advantage of the proposed method is in eliminating the necessity to scan the whole data set, for every new set of transactions, which is the limitation in existing sequential pattern mining algorithms. The result of the proposed method is analysed, which shows that the proposed algorithm provides support for large data set analysis, taking care of both execution time and memory usage. Also, we have proposed a pilot approach on how the proposed sequential pattern mining algorithm would work in a parallel environment.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook