Data mining of serial-episode association rules using gap-constrained minimal occurrences
by H.K. Dai; Z. Wang
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 8, No. 3, 2013

Abstract: Data mining is a task of extracting useful patterns/episodes from large databases. Sequence data can be modelled using episodes. An episode is serial if the underlying temporal order is total. An episode rule of associating two episodes suggests a temporal implication of the antecedent episode to the consequent episode. We present two sound and complete mining algorithms for finding frequent and confident serial-episode association rules with their ideal occurrence/window widths, if existing, in event sequences based on the notion of minimal occurrences constrained by constant and mean maximum gap, respectively. Two empirical studies are summarised: one focused on the absence of dependencies of local-maximum confidence on the ideal occurrence/window widths in synthetic random datasets, and the other on the applicability of the episode-rule mining algorithms with a set of earthquake data.

Online publication date: Sat, 28-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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