Dynamic Programming Approach for Construction of Association Rule Systems

In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work.

[1]  Hannu Toivonen,et al.  Sampling Large Databases for Association Rules , 1996, VLDB.

[2]  Peter L. Hammer,et al.  Maximum patterns in datasets , 2008, Discret. Appl. Math..

[3]  Beata Zielosko.  Optimization of Approximate Decision Rules Relative to Coverage , 2014, BDAS.

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

[5]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[6]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[7]  Christian Borgelt,et al.  Induction of Association Rules: Apriori Implementation , 2002, COMPSTAT.

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

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

[10]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

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

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

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

[14]  Mikhail Ju. Moshkov,et al.  Combinatorial Machine Learning - A Rough Set Approach , 2011, Studies in Computational Intelligence.

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

[16]  David H. Glass,et al.  Confirmation measures of association rule interestingness , 2013, Knowl. Based Syst..

[17]  Beata Zielosko.  Global Optimization of Exact Association Rules Relative to Length , 2015, CS&P.

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

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

[20]  J. Stefanowski,et al.  Induction of decision rules in classification and discovery‐oriented perspectives , 2001 .

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