Dynamic Programming Approach for Construction of Association Rule Systems

Fawaz Alsolami; Talha M. Amin; Igor Chikalov; Mikhail Moshkov; Beata Zielosko

doi:10.3233/FI-2016-1402

Dynamic Programming Approach for Construction of Association Rule Systems

Fawaz Alsolami, Talha M. Amin, Igor Chikalov, Mikhail Moshkov, Beata Zielosko

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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.

Original language	English (US)
Pages (from-to)	159-171
Number of pages	13
Journal	Fundamenta Informaticae
Volume	147
Issue number	2-3
DOIs	https://doi.org/10.3233/FI-2016-1402
State	Published - Nov 18 2016

Bibliographical note

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.

Access to Document

10.3233/FI-2016-1402

Cite this

@article{a155d70437f2487b80c43085242f831e,

title = "Dynamic Programming Approach for Construction of Association Rule Systems",

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.",

author = "Fawaz Alsolami and Amin, {Talha M.} and Igor Chikalov and Mikhail Moshkov and Beata Zielosko",

note = "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.",

year = "2016",

month = nov,

day = "18",

doi = "10.3233/FI-2016-1402",

language = "English (US)",

volume = "147",

pages = "159--171",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press BV",

number = "2-3",

}

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 -

Dynamic Programming Approach for Construction of Association Rule Systems

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this