A novel algorithm for extracting knowledge based on mining multi-level sequential patterns
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 6 (2012)
Issue (Month): 3 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=206|
When requesting a correction, please mention this item's handle: RePEc:ids:ijbsre:v:6:y:2012:i:3:p:269-278. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Darren Simpson)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.