KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Applied Mathematics and Computational Science Program
Online Publication Date2019-03-22
Print Publication Date2019-03-14
Permanent link to this recordhttp://hdl.handle.net/10754/631800
MetadataShow full item record
AbstractIn 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.
CitationFawaz Alsolami, Talha Amin, Mikhail Moshkov, Beata Zielosko, Krzysztof Żabiński. Comparison of Heuristics for Optimization of Association Rules. FI. IOS Press; 2019;166: 1–14. doi:10.3233/FI-2019-1791
SponsorsResearch reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST) and University of Silesia in Katowice.