CSSF-trie structure to mine constraint sequential patterns from progressive database Online publication date: Thu, 31-Jul-2014
by V. Chandra Shekhar Rao; P. Sammulal
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 2, No. 4, 2013
Abstract: This paper delineates the purpose of an algorithm for mining constraint sequential patterns from a progressive database. We construct the updated CSSF-trie from the static database with the intention of efficiently capturing the dynamic nature of data addition and deletion into the mining problem. Whenever the database gets updated from the distributed sources, the database may be static, inserted, or deleted. CSSF trie is also updated by including the updated sequence. The updated CSSF-trie is used to mine the progressive CSSF-patterns using the proposed algorithm. Finally, the experimentation is carried out using the synthetic and real life distributed databases that are given to the progressive CSSF-miner using thread environment. The experimental results provide better results in terms of the generated number of sequential patterns, execution time and the memory usage over the existing IncSpan algorithm.
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