Dynamic Programming Approach for Construction of Association Rule Systems

Issue title: Concurrency, Specification, and Programming: Special Issue of Selected Papers of CS&P 2015

Guest editors: Ludwik Czaja, Wojciech Penczek and Krzysztof Stencel

Article type: Research Article

Authors: Alsolami, Fawaz^a | Amin, Talha^{a; *} | Chikalov, Igor^a | Moshkov, Mikhail^a | Zielosko, Beata^b

Affiliations: [a] Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia. {fawaz.alsolami, talha.amin, mikhail.moshkov}@kaust.edu.sa, igor.chikalov@gmail.com | [b] Institute of Computer Science, University of Silesia, 39, Będzińska St., 41-200 Sosnowiec, Poland. beata.zielosko@us.edu.pl

Correspondence: [*] Address for correspondence: Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia

Abstract: In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. The association rule set is optimized in two stages, first for minimum cardinality and then for minimum length of rules. 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 as well as obtained results for length.

Keywords: association rules, decision rules, dynamic programming, set cover problem, rough sets

DOI: 10.3233/FI-2016-1402

Journal: Fundamenta Informaticae, vol. 147, no. 2-3, pp. 159-171, 2016