Name:
Fawaz_FI_B2018Revised (2).pdf
Size:
228.4Kb
Format:
PDF
Description:
Accepted Manuscript
Type
ArticleKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionComputer Science Program
Applied Mathematics and Computational Science Program
Date
2019-03-22Online Publication Date
2019-03-22Print Publication Date
2019-03-14Permanent link to this record
http://hdl.handle.net/10754/631800
Metadata
Show full item recordAbstract
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.Citation
Fawaz 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-1791Sponsors
Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST) and University of Silesia in Katowice.Publisher
IOS PressJournal
Fundamenta InformaticaeAdditional Links
https://content.iospress.com/articles/fundamenta-informaticae/fi1791ae974a485f413a2113503eed53cd6c53
10.3233/FI-2019-1791