Authors: SeungYong Yoon; Hirohisa Seki
Addresses: Department of Computer Science and Engineering, Nagoya Institute of Technology, Nagoya, Japan ' Department of Computer Science and Engineering, Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan
Abstract: Many methods have been studied for mining sequential patterns from a sequence database. In particular, Lo et al. have proposed the notion of recurrent rules and an algorithm called NR3 for mining them. Recurrent rules can express temporal constraints such as "Whenever a series of precedent events occurs, eventually a series of consequent events occurs", and they are useful in various domains, especially in software specification and verification. Although the algorithm NR3 and its successor BOB for mining non-redundant recurrent rules have been given by Lo et al. mining recurrent rules still requires considerable computational costs. In this paper, we propose a new algorithm, called LF-NR3, to make NR3 more efficient, which is based on a familiar program transformation loop fusion. We apply the loop fusion technique to NR3, thereby simplifying the operations of the original mining algorithm. We also make use of a hash-based data structure to reduce loads of the manipulation of sequences repeatedly required in mining recurrent rules. We show the effectiveness of our proposed method based on experimental results of some datasets used in the literature.
Keywords: sequential pattern mining; recurrent rule; sequence database; program transformation; vertical data format.
International Journal of Computational Intelligence Studies, 2018 Vol.7 No.3/4, pp.253 - 269
Received: 02 Feb 2018
Accepted: 14 May 2018
Published online: 13 Nov 2018 *