ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Discovering frequent chain episodes

Achar, Avinash and Sastry, P S (2019) Discovering frequent chain episodes. In: KNOWLEDGE AND INFORMATION SYSTEMS, 60 (1). pp. 447-494.

[img] PDF
kno_inf_sys_60-1_447_2019.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: https://dx.doi.org/10.1007/s10115-019-01349-y


Frequent episode discovery is a popular framework in temporal data mining with many applications. An episode is a partially ordered set of nodes with each node associated with an event-type. The episodes literature has seen different notions of frequency and a variety of associated discovery algorithms under these different frequencies when the associated partial order is total (serial episode) or trivial (parallel episode). Recently an apriori-based discovery algorithm for mining episodes where the associated partial order has no restriction but the node to event-type association is one-one (general injective episodes) was proposed based on the non-overlapped frequency measure. This work pointed out that frequency alone is not a sufficient indicator of interestingness in the context of episodes with general partial orders and introduced a new measure of interestingness called bidirectional evidence (BE) to address this issue. This algorithm discovers episodes by incorporating both frequency and BE thresholds in the level-wise procedure. In this paper, we extend this BE-based algorithm to a much larger class of episodes that we call chain episodes. This class encompasses all serial and parallel episodes (injective or otherwise) and also many other non-injective episodes with unrestricted partial orders. We first discuss how the BE measure can be generalized to chain episodes and prove the monotonicity property it satisfies in this general context. We then describe our candidate generation step (with correctness proofs) which nicely exploits this new monotonicity property. We further describe the frequency counting (with correctness proofs) and BE computation steps for chain episodes. The experimental results demonstrate the effectiveness of our algorithms.

Item Type: Journal Article
Additional Information: copyright for this article belongs to SPRINGER LONDON LTD
Keywords: Data mining; Episode; Apriori-based; Non-overlapped frequency; Partial order
Department/Centre: Division of Electrical Sciences > Electrical Engineering
Date Deposited: 05 Aug 2019 09:49
Last Modified: 05 Aug 2019 09:49
URI: http://eprints.iisc.ac.in/id/eprint/63377

Actions (login required)

View Item View Item