MR-Radix: a multi-relational data mining algorithm

BackgroundOnce multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach.MethodsAiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix.ResultsThis work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine.ConclusionThe comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.

[1]  David Page,et al.  Biological applications of multi-relational data mining , 2003, SKDD.

[2]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[3]  Ankur Teredesai,et al.  CoMMA: a framework for integrated multimedia mining using multi-relational associations , 2005, Knowledge and Information Systems.

[4]  Xuequn Shang,et al.  SQL based frequent pattern mining , 2005 .

[5]  Lawrence B. Holder,et al.  Comparison of graph-based and logic-based multi-relational data mining , 2005, SKDD.

[6]  Hongjun Lu,et al.  H-mine: hyper-structure mining of frequent patterns in large databases , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

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

[8]  Nava Pliskin,et al.  Mining relational patterns from multiple relational tables , 1999, Decis. Support Syst..

[9]  Songfeng Lu,et al.  Mining association rules using clustering , 2001, Intell. Data Anal..

[10]  Hugh E. Williams,et al.  Scalable multi-relational association mining , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[11]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[12]  George Karypis,et al.  An efficient algorithm for discovering frequent subgraphs , 2004, IEEE Transactions on Knowledge and Data Engineering.

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

[14]  Ke Wang,et al.  Top Down FP-Growth for Association Rule Mining , 2002, PAKDD.

[15]  Marcela Xavier Ribeiro,et al.  Analysis of Hepatitis Dataset using Multirelational Association Rules , 2005 .

[16]  Tadashi Horiuchi,et al.  Extension of Graph-Based Induction for General Graph Structured Data , 2000, PAKDD.

[17]  R. Gopalan,et al.  High Performance Frequent Patterns Extraction using Compressed FP-Tree , .

[18]  D. Edwards.  Data Mining: Concepts, Models, Methods, and Algorithms , 2003 .

[19]  Hendrik Blockeel,et al.  Multi-Relational Data Mining , 2005, Frontiers in Artificial Intelligence and Applications.

[20]  Luc De Raedt,et al.  Multirelational data mining 2003: workshop report , 2003, SKDD.

[21]  Ashok N. Srivastava,et al.  Data Mining: Concepts, Models, Methods, and Algorithms , 2005, J. Comput. Inf. Sci. Eng..

[22]  Amaury Habrard,et al.  Multi-relational Data Mining in Medical Databases , 2003, AIME.

[23]  Ke Wang,et al.  Mining frequent item sets by opportunistic projection , 2002, KDD.

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

[25]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[26]  Andrea Pietracaprina,et al.  Mining Frequent Itemsets using Patricia Tries , 2003, FIMI.

[27]  Saso Dzeroski,et al.  Multi-relational data mining 2004: workshop report , 2004, SKDD.

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