Comparison of Heuristics for Optimization of Association Rules

Fawaz Alsolami, Talha M. Amin, Mikhail Moshkov, Beata Zielosko, Krzysztof Żabiński

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.
Original languageEnglish (US)
Pages (from-to)1-14
Number of pages14
JournalFundamenta Informaticae
Issue number1
StatePublished - Mar 22 2019

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) and University of Silesia in Katowice.


Dive into the research topics of 'Comparison of Heuristics for Optimization of Association Rules'. Together they form a unique fingerprint.

Cite this