A novel algorithm for extracting knowledge based on mining multi-level sequential patterns Online publication date: Fri, 14-Nov-2014
by Negar Gh Ghanbari; Mohammad Reza Gholamian
International Journal of Business and Systems Research (IJBSR), Vol. 6, No. 3, 2012
Abstract: In this paper, we consider the problem of finding sequential patterns in multi-levels, with aid of candidate generate and test approach. Based on this technique, many sequential pattern algorithms have been developed, but few of them have paid attention to multi-level concept. We thus purpose a new efficient algorithm, called dynamic vertices levelwise (DVlw) for mining multi-level sequence patterns. It uses the same principals as other candidate generation and test algorithms but handles multi-levelled property for sequences prior to and separately from the testing and counting steps of candidate sequences. Empirical evaluation using synthetic data indicates that the proposed algorithm performs significantly faster than a state-of-the-art algorithm with this approach.
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 Business and Systems Research (IJBSR):
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