Mining sequential patterns including time intervals
Mariko Yoshida, Tetsuya Iizuka, Hisako Shiohara, Masanori Ishiguro · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2000
We introduce the problem of mining sequential patterns among items in a large database of sequences. For example, let us consider a database recording storm patterns, in such an area, at such a given time. An example of the patterns we are interested in is: '10% of storms go through area C 3 days after they strike areas A and B.' Previous research would have considered some equivalent patterns, but such work would use only 'after' (a succession in time) and omit '3 days after' (a period). Obtaining such patterns is very useful because we know when actions should be taken. To address this issue, we are studying an algorithm for discovering ordered lists of itemsets (a sets of items) with the time intervals between itemsets that occur in a sufficient number of sequences of transactions, we call these patterns 'delta pattern.' In this algorithm, we cluster time intervals between two neighboring itemsets using the CF-tree method while scanning the database and counting the number of occurrences of each candidate pattern. Extensive simulations are being conducted to evaluate patterns and to discover the power and performance of this algorithm. This algorithm has very good scale-up properties in execution time with respect to the number of data-sequences.