TY - JOUR
T1 - Comparison of Heuristics for Optimization of Association Rules
AU - Alsolami, Fawaz
AU - Amin, Talha M.
AU - Moshkov, Mikhail
AU - Zielosko, Beata
AU - Żabiński, Krzysztof
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) and University of Silesia in Katowice.
PY - 2019/3/22
Y1 - 2019/3/22
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/631800
UR - https://content.iospress.com/articles/fundamenta-informaticae/fi1791
UR - http://www.scopus.com/inward/record.url?scp=85063324389&partnerID=8YFLogxK
U2 - 10.3233/FI-2019-1791
DO - 10.3233/FI-2019-1791
M3 - Article
SN - 0169-2968
VL - 166
SP - 1
EP - 14
JO - Fundamenta Informaticae
JF - Fundamenta Informaticae
IS - 1
ER -