Dynamic Programming Approach for Construction of Association Rule Systems

Handle URI:
http://hdl.handle.net/10754/622538
Title:
Dynamic Programming Approach for Construction of Association Rule Systems
Authors:
Alsolami, Fawaz ( 0000-0001-5858-4908 ) ; Amin, Talha ( 0000-0003-3035-8612 ) ; Chikalov, Igor; Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Zielosko, Beata
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Fawaz Alsolami, Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko. Dynamic Programming Approach for Construction of Association Rule Systems. FI. IOS Press; 2016;147: 159–171. doi:10.3233/FI-2016-1402
Publisher:
IOS Press
Journal:
Fundamenta Informaticae
Issue Date:
18-Nov-2016
DOI:
10.3233/FI-2016-1402
Type:
Article
ISSN:
0169-2968; 1875-8681
Sponsors:
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.
Additional Links:
http://content.iospress.com/articles/fundamenta-informaticae/fi1402
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAlsolami, Fawazen
dc.contributor.authorAmin, Talhaen
dc.contributor.authorChikalov, Igoren
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorZielosko, Beataen
dc.date.accessioned2017-01-02T09:55:29Z-
dc.date.available2017-01-02T09:55:29Z-
dc.date.issued2016-11-18en
dc.identifier.citationFawaz Alsolami, Talha Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko. Dynamic Programming Approach for Construction of Association Rule Systems. FI. IOS Press; 2016;147: 159–171. doi:10.3233/FI-2016-1402en
dc.identifier.issn0169-2968en
dc.identifier.issn1875-8681en
dc.identifier.doi10.3233/FI-2016-1402en
dc.identifier.urihttp://hdl.handle.net/10754/622538-
dc.description.abstractIn 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.en
dc.description.sponsorshipResearch 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.en
dc.publisherIOS Pressen
dc.relation.urlhttp://content.iospress.com/articles/fundamenta-informaticae/fi1402en
dc.subjectassociation rulesen
dc.subjectdecision rulesen
dc.subjectdynamic programmingen
dc.subjectrough setsen
dc.subjectset cover problemen
dc.titleDynamic Programming Approach for Construction of Association Rule Systemsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalFundamenta Informaticaeen
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzińska St., Sosnowiec, Polanden
kaust.authorAlsolami, Fawazen
kaust.authorAmin, Talhaen
kaust.authorChikalov, Igoren
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.