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

Discovering association rules from time-series data is an important data mining problem. The number of potential rules 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 by Saquer and Deogun (2000). 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]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[2]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[3]  Ramakrishnan Srikant,et al.  Mining Association Rules with Item Constraints , 1997, KDD.

[4]  Jian Pei,et al.  Can we push more constraints into frequent pattern mining? , 2000, KDD '00.

[5]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[6]  T. McKee,et al.  Drought monitoring with multiple time scales , 1995 .

[7]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

[8]  Dimitrios Gunopulos,et al.  Constraint-Based Rule Mining in Large, Dense Databases , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[9]  Marzena Kryszkiewicz,et al.  Fast Discovery of Representative Association Rules , 1998, Rough Sets and Current Trends in Computing.

[10]  Heikki Mannila,et al.  Rule Discovery from Time Series , 1998, KDD.

[11]  Heikki Mannila,et al.  Discovering Generalized Episodes Using Minimal Occurrences , 1996, KDD.

[12]  Mohammed J. Zaki.  Generating non-redundant association rules , 2000, KDD '00.

[13]  Dina Q. Goldin,et al.  On Similarity Queries for Time-Series Data: Constraint Specification and Implementation , 1995, CP.

[14]  Wynne Hsu,et al.  Pruning and summarizing the discovered associations , 1999, KDD '99.

[15]  Hannu Toivonen,et al.  Sampling Large Databases for Association Rules , 1996, VLDB.

[16]  Marzena Kryszkiewicz,et al.  Representative Association Rules , 1998, PAKDD.

[17]  Heikki Mannila,et al.  Discovering Frequent Episodes in Sequences , 1995, KDD.

[18]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[19]  Laks V. S. Lakshmanan,et al.  Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.

[20]  Jitender S. Deogun,et al.  Using Closed Itemsets for Discovering Representative Association Rules , 2000, ISMIS.

[21]  Hongjun Lu,et al.  Mining inter-transaction associations with templates , 1999, CIKM '99.

[22]  X.S. Wang,et al.  Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences , 1998, IEEE Trans. Knowl. Data Eng..