Mining and post-mining of time stamped association rules

We study the problem of discovering time stamped association rules and to post-mine it for reducing the number of rules to make it user interesting. Most works in mining association rules produces a large number of rules which are almost non-interesting to the user. In this paper, we propose an algorithm which uses the concept of lower bounding distance and ontology to mine and post-mine the rules respectively. This paper defines a matching operator for rule selection. The matching operator selects the time stamped association rule that matches with the user-specified constraint. The experimental results show that the execution time is reduced when compared with the traditional mining method. Also the number of rules is greatly reduced when the matching operator is used. Our approach will help the decision maker to analyze the results effectively.

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

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

[3]  Jian Pei,et al.  CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[4]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[5]  Christos Faloutsos,et al.  Fast Time Sequence Indexing for Arbitrary Lp Norms , 2000, VLDB.

[6]  Andrea Bellandi,et al.  Ontology-driven Association Rules Extraction: a Case of Study , 2007, C&O:RR.

[7]  Stefan Conrad,et al.  TARtool: A Temporal Dataset Generator for Market Basket Analysis , 2008, ADMA.

[8]  Sridhar Ramaswamy,et al.  On the Discovery of Interesting Patterns in Association Rules , 1998, VLDB.

[9]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[10]  Sushil Jajodia,et al.  Discovering calendar-based temporal association rules , 2003 .

[11]  Fabrice Guillet,et al.  A user-driven and quality-oriented visualization for mining association rules , 2003, Third IEEE International Conference on Data Mining.

[12]  Dimitrios Gunopulos,et al.  Time series similarity measures (tutorial PM-2) , 2000, KDD '00.

[13]  Jiawei Han,et al.  Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

[14]  Fabrice Guillet,et al.  Knowledge-Based Interactive Postmining of Association Rules Using Ontologies , 2010, IEEE Transactions on Knowledge and Data Engineering.

[15]  Dimitrios Gunopulos.  Time Series Similarity Measures , 2005 .

[16]  Fabrice Guillet,et al.  Quality Measures in Data Mining , 2009, Studies in Computational Intelligence.

[17]  Jinyan Li,et al.  Efficient mining of emerging patterns: discovering trends and differences , 1999, KDD '99.

[18]  Johannes Gehrke,et al.  MAFIA: a maximal frequent itemset algorithm , 2005, IEEE Transactions on Knowledge and Data Engineering.

[19]  Jaideep Srivastava,et al.  Selecting the right objective measure for association analysis , 2004, Inf. Syst..

[20]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[21]  Shashi Shekhar,et al.  Similarity-Profiled Temporal Association Mining , 2009, IEEE Transactions on Knowledge and Data Engineering.

[22]  Sushil Jajodia,et al.  Looking into the seeds of time: Discovering temporal patterns in large transaction sets , 2006, Inf. Sci..

[23]  Sridhar Ramaswamy,et al.  Cyclic association rules , 1998, Proceedings 14th International Conference on Data Engineering.

[24]  Wynne Hsu,et al.  Discovering the set of fundamental rule changes , 2001, KDD '01.