Mining Several Kinds of Temporal Association Rules Enhanced by Tree Structures

Market basket analysis is one important application of knowledge discovery in databases. Real life market basket databases usually contain temporal coherences, which cannot be captured by means of standard association rule mining. Thus there is a need for developing algorithms, that reveal such temporal coherences within this data. This paper gathers several notions of temporal association rules and presents an approach for mining most of these kinds (cyclic, lifespan- and calendar-based) in a market basket database, enhanced by two novel tree structures. We called these two tree structures EP- and ET-Tree, which are derived from existing approaches improving standard association rule mining. They are used as representation of the database and thus make the discovery of temporal association rules very efficient.

[1]  Frans Coenen,et al.  Algorithms for computing association rules using a partial-support tree , 2000, Knowl. Based Syst..

[2]  Gustavo Rossi,et al.  An approach to discovering temporal association rules , 2000, SAC '00.

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

[4]  Ron Rymon,et al.  Search through Systematic Set Enumeration , 1992, KR.

[5]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[6]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

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

[8]  Vipin Kumar,et al.  Introduction to Data Mining , 2022, Data Mining and Machine Learning Applications.

[9]  Keshri Verma,et al.  Temporal Approach to Association Rule Mining Using T-Tree and P-Tree , 2005, MLDM.

[10]  John F. Roddick,et al.  YABTSSTDMR, Yet Another Bibliography of Temporal, Spatial, and Spatio-Temporal Data Mining Resear , 2001 .

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

[12]  Xiang Li,et al.  Advanced Data Mining and Applications (ADMA) , 2008, ADMA 2008.

[13]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

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

[15]  Vipin Kumar,et al.  Introduction to Data Mining, (First Edition) , 2005 .

[16]  Dimitris Kanellopoulos,et al.  Association Rules Mining: A Recent Overview , 2006 .

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

[18]  John F. Roddick,et al.  ARMADA - An algorithm for discovering richer relative temporal association rules from interval-based data , 2007, Data Knowl. Eng..

[19]  Frans Coenen,et al.  Tree Structures for Mining Association Rules , 2004, Data Mining and Knowledge Discovery.

[20]  Jiawei Han,et al.  Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[21]  Cláudia Antunes,et al.  Temporal Data Mining: an overview , 2001 .

[22]  P. S. Sastry,et al.  A survey of temporal data mining , 2006 .