Mining of Multi-Relational Association Rules

Association rule mining is one of the most important and basic technique in data mining,which has been studied extensively and has a wide range of applications.However,as traditional data mining algorithms usually only focus on analyzing data organized in single table,applying these algorithms in multi-relational data environment will result in many problems.This paper summarizes these problems,proposes a framework for the mining of multi-relational association rule,and gives a definition of the mining task.After classifying the existing work into two categories,it describes the main techniques used in several typical algorithms,and it also makes comparison and analysis among them.Finally,it points out some issues unsolved and some future further research work in this area.

[1]  Philip S. Yu,et al.  CrossMine: efficient classification across multiple database relations , 2004, Proceedings. 20th International Conference on Data Engineering.

[2]  Hervé Thiriez,et al.  OR software , 1998, European Journal of Operational Research.

[3]  Srinivasan Parthasarathy,et al.  New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[4]  Sunita Sarawagi,et al.  Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications , 1998, SIGMOD '98.

[5]  Michelangelo Ceci,et al.  Mr-SBC: A Multi-relational Naïve Bayes Classifier , 2003, PKDD.

[6]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

[7]  Devavrat Shah,et al.  Turbo-charging vertical mining of large databases , 2000, SIGMOD '00.

[8]  Luc Dehaspe,et al.  Discovery of relational association rules , 2001 .

[9]  Hannu Toivonen,et al.  Finding Frequent Substructures in Chemical Compounds , 1998, KDD.

[10]  Amanda Clare,et al.  Genome scale prediction of protein functional class from sequence using data mining , 2000, KDD '00.

[11]  Luc Dehaspe.  Frequent Pattern Discovery in First-Order Logic , 1999, AI Commun..

[12]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[13]  Joost N. Kok,et al.  Faster Association Rules for Multiple Relations , 2001, IJCAI.

[14]  Hannu Toivonen,et al.  Discovery of frequent DATALOG patterns , 1999, Data Mining and Knowledge Discovery.

[15]  Peter A. Flach,et al.  Propositionalization approaches to relational data mining , 2001 .

[16]  Li-jun Xu,et al.  A novel algorithm for frequent itemset mining in data warehouses , 2006 .

[17]  Luc De Raedt,et al.  Mining Association Rules in Multiple Relations , 1997, ILP.

[18]  Hongyan Liu,et al.  Top-Down Mining of Interesting Patterns from Very High Dimensional Data , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[19]  Ke Wang,et al.  Mining association rules from stars , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[20]  Hongyan Liu,et al.  Mining Interesting Patterns from Very High Dimensional Data: A Top-Down Row Enumeration Approach , 2006, SDM.

[21]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.

[22]  Heikki Mannila,et al.  Efficient Algorithms for Discovering Association Rules , 1994, KDD Workshop.

[23]  Mohammed J. Zaki,et al.  CHARM: An Efficient Algorithm for Closed Association Rule Mining , 2007 .

[24]  J. C. Bioch,et al.  Mining Frequent Intemsets in Memory-Resident Databases , 2000 .

[25]  Donato Malerba,et al.  Mining spatial association rules in census data , 2002 .

[26]  Nandit Soparkar,et al.  Frequent Itemset Counting Across Multiple Tables , 2000, PAKDD.

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

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

[29]  Gösta Grahne,et al.  Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[30]  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.

[31]  Anthony K. H. Tung,et al.  Carpenter: finding closed patterns in long biological datasets , 2003, KDD '03.

[32]  Pedro M. Domingos.  Prospects and challenges for multi-relational data mining , 2003, SKDD.