Sequential association rule mining with time lags

被引:97
作者
Harms, SK [1 ]
Deogun, JS
机构
[1] Univ Nebraska, Dept Comp Sci & Informat Syst, Kearney, NE 68849 USA
[2] Univ Nebraska, Dept Comp Sci & Comp Engn, Lincoln, NE 68588 USA
关键词
sequential rule discovery; time lag; knowledge discovery; drought risk management;
D O I
10.1023/A:1025824629047
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:7 / 22
页数:16
相关论文
共 19 条
  • [1] [Anonymous], P 5 INT C EXT DAT TE
  • [2] [Anonymous], 1995, P 1 SIGKDD INT C KNO
  • [3] Discovering frequent event patterns with multiple granularities in time sequences
    Bettini, C
    Wang, XS
    Jajodia, S
    Lin, JL
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1998, 10 (02) : 222 - 237
  • [4] CONG G, 2002, P 2002 IEEE INT C DA
  • [5] FENG L, 1999, P 1999 INT C INF KNO
  • [6] Goddard S, 2003, COMMUN ACM, V46, P35, DOI 10.1145/602421.602442
  • [7] Goldin D. Q., 1995, Principles and Practice of Constraint Programming - CP '95. First International Conference, CP'95. Proceedings, P137
  • [8] Harms SK, 2002, LECT NOTES ARTIF INT, V2366, P432
  • [9] Discovering representative episodal association rules from event sequences using frequent closed episode sets and event constraints
    Harms, SK
    Deogun, J
    Saquer, J
    Tadesse, T
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 603 - 606
  • [10] KRYSZKIEWICZ M, 1998, LECT NOTES ARTIF INT, V1424, P214