Sequential Association Rule Mining with Time Lags

  • Authors:

  • Sherri K. Harms;Jitender S. Deogun

  • Affiliations:

  • Department of Computer Science and Information Systems, University of Nebraska at Kearney, NE 68849, USA. harmssk@unk.edu;Department of Computer Science and Computer Engineering, University of Nebraska at Lincoln, NE 68588, USA. deogun@cse.unl.edu

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper presents MOWCATL, an efficient method for mining frequent association rules from multiple sequential data sets. Our goal is to find patterns in one or more sequences that precede the occurrence of patterns in other sequences. Recent work has highlighted the importance of using constraints to focus the mining process on the association rules relevant to the user. To refine the data mining process, this approach introduces the use of separate antecedent and consequent inclusion constraints, in addition to the traditional frequency and support constraints in sequential data mining. Moreover, separate antecedent and consequent maximum window widths are used to specify the antecedent and consequent patterns that are separated by either a maximal width time lag or a fixed width time lag.Multiple time series drought risk management data are used to show that our approach can be effectively employed in real-life problems. This approach is compared to existing methods to show how they complement each other to discover associations in the drought risk management domain. The experimental results validate the superior performance of our method for efficiently finding relationships between global climatic episodes and local drought conditions. Both the maximal and fixed width time lags are shown to be useful when finding interesting associations.