TY - JOUR
T1 - Dynamic Programming Approach for Construction of Association Rule Systems
AU - Alsolami, Fawaz
AU - Amin, Talha M.
AU - Chikalov, Igor
AU - Moshkov, Mikhail
AU - Zielosko, Beata
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authors are greatly indebted to reviewers for useful comments.
PY - 2016/11/18
Y1 - 2016/11/18
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/622538
UR - http://content.iospress.com/articles/fundamenta-informaticae/fi1402
UR - http://www.scopus.com/inward/record.url?scp=84997416739&partnerID=8YFLogxK
U2 - 10.3233/FI-2016-1402
DO - 10.3233/FI-2016-1402
M3 - Article
SN - 0169-2968
VL - 147
SP - 159
EP - 171
JO - Fundamenta Informaticae
JF - Fundamenta Informaticae
IS - 2-3
ER -