Discovering representative episodal association rules from event sequences using frequent closed episode sets and event constraints

被引:21
作者
Harms, SK [1 ]
Deogun, J [1 ]
Saquer, J [1 ]
Tadesse, T [1 ]
机构
[1] Univ Nebraska, Dept CSCE, Lincoln, NE 68588 USA
来源
2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS | 2001年
关键词
D O I
10.1109/ICDM.2001.989576
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Discovering association rules from time-series data is an important data mining problem. The number of potential rides grows quickly as the number of items in the antecedent grows. It is therefore difficult for an expert to analyze the rules and identify the useful. An approach for generating representative association rules for transactions that uses only a subset of the set of frequent itemsets called frequent closed itemsets was presented in [6]. We employ formal concept analysis to develop the notion of frequent closed episodes. The concept of representative association rules is formalized in the context of event sequences. Applying constraints to target highly significant rules further reduces the number of rules. Our approach results in a significant reduction of the number of rules generated, while maintaining the minimum set of relevant association rules and retaining the ability, to generate the entire set of association rules with respect to the given constraints. We show how our method can be used to discover associations in a drought risk management decision support system and use multiple climatology datasets related to automated weather stations(1).
引用
收藏
页码:603 / 606
页数:4
相关论文
共 8 条
  • [1] Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
  • [2] BAYARDO R, 1999, P ICDE 99
  • [3] HARMS SK, 2001, P 2001 NAT C DIG GOV
  • [4] KRYSZKIEWICZ M, 1998, LECT NOTES ARTIF INT, V1424, P214
  • [5] MANNILA H, 1997, C199715 U HELS DEP C
  • [6] SAQUER J, 2000, P 12 INT S METH INT
  • [7] Srikant R., 1997, Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, P67
  • [8] ZAKI M, 2000, P 6 INT C KNOWL DISC