Mining serial positioning episode rules by natural exponent inertia weight based swallow swarm optimization algorithm with constraint based event sequences
Affiliations: Department of Information Technology, Anna University, MIT Campus, Chennai, India
Correspondence:
[*]
Corresponding author. K. Poongodi, Department of Information Technology, Anna University, MIT Campus, Chennai, India. Tel.: +91 94430 31603; E-mail: [email protected].
Abstract: The Frequent Episode Mining (FEM) is a challenging framework to identify frequent episodes from a sequence database. In a sequence, an ordered collection of events defines an episode, and frequent episodes are only considered by the earlier studies. Also, it doesn’t support for the serial based episode rule mining. In this work, the episode rules are mined with precise and serial based rule mining considering the temporal factor, so that, the occurrence time of the consequent is specified in contrast to the traditional episode rule mining. The proposed work has a larger number of candidates and specific time constraints to generate the fixed-gap episodes, and mining such episodes from whole sequence where the time span between any two events is a constant which is utilized to improve the proposed framework’s performance. In order to improve the efficiency, an Optimal Fixed-gap Episode Occurrence (OFEO) is performed using the Natural Exponent Inertia Weight based Swallow Swarm Optimization (NEIWSSO) algorithm. The temporal constraints significantly evaluate the effectiveness of episode mining, and a noticeable advantage of the present work is to generate optimal fixed-gap episodes for better prediction. The effective use of memory consumption and performance enhancement is achieved by developing new trie-based data structure for Mining Serial Positioning Episode Rules (MSPER) using a pruning method. The position of frequent events is updated in the precise-positioning episode rule trie instead of frequent events to reduce the memory space. The benchmark datasets Retail, Kosarak, and MSNBC is used to evaluate the proposed algorithm’s efficiency. Eventually, it is found that it outperforms the existing techniques with respect to memory consumption and execution time. On an average, the proposed algorithm achieves 28 times lesser execution time and consumes 45.5% less memory space for the highest minimum support value on the Retail dataset compared to existing methods.
Keywords: Frequent episode mining, fixed-gap episode occurrence, natural exponent
inertia weight, support of fixed-gap episode
