Global Optimization of Exact Association Rules Relative to Length

In the paper, an application of dynamic programming approach to global optimization of exact association rules relative to length is presented. It is an extension of the dynamic programming approach to optimization of decision rules to inconsistent tables. An information system I is transformed into a set of decision tables {If1 , . . . , Ifn+1}. The algorithm constructs, for each decision table from the set {If1 , . . . , Ifn+1}, a directed acyclic graph ∆(Ifi), i = 1, . . . , n + 1. Based on the graph, the set of so-called irredundant (fi)association rules can be described. The union of sets of (fi)-association rules, i = 1, . . . , n + 1, is considered as a set of association rules for information system I . Then, global optimization relative to length is made and sets of association rules with minimum length, for each row of information system I , are obtained. Preliminary experimental results with data sets from UCI Machine Learning Repository are included.

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

[2]  Dominik Slezak,et al.  Approximate Reducts and Association Rules - Correspondence and Complexity Results , 1999, RSFDGrC.

[3]  Christian Borgelt,et al.  An implementation of the FP-growth algorithm , 2005 .

[4]  Mikhail Ju. Moshkov.  On the class of restricted linear information systems , 2007, Discret. Math..

[5]  Igor Chikalov,et al.  Dynamic Programming Approach for Exact Decision Rule Optimization , 2013, Rough Sets and Intelligent Systems.

[6]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[7]  Roman Slowinski,et al.  Generating a set of association and decision rules with statistically representative support and anti-support , 2014, Inf. Sci..

[8]  Sinh Hoa Nguyen,et al.  Rough Sets and Association Rule Generation , 1999, Fundam. Informaticae.

[9]  Christian Borgelt,et al.  Simple Algorithms for Frequent Item Set Mining , 2010, Advances in Machine Learning II.

[10]  Beata Zielosko.  Global Optimization of Exact Association Rules Relative to Coverage , 2015, PReMI.

[11]  Mikhail Ju. Moshkov,et al.  On Construction of Partial Association Rules , 2009, RSKT.

[12]  Andrzej Skowron,et al.  Rudiments of rough sets , 2007, Inf. Sci..

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

[14]  Beata Zielosko.  Optimization of Decision Rules Relative to Coverage - Comparative Study , 2014, RSEISP.

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

[16]  Igor Chikalov,et al.  On Algorithm for Constructing of Decision Trees with Minimal Depth , 2000, Fundam. Informaticae.

[17]  Shahid Hussain,et al.  Dagger: A Tool for Analysis and Optimization of Decision Trees and Rules , 2011 .

[18]  Mustafa Mat Deris,et al.  A soft set approach for association rules mining , 2011, Knowl. Based Syst..

[19]  Mikhail Ju. Moshkov,et al.  Greedy Algorithm for Construction of Partial Association Rules , 2009, Fundam. Informaticae.