Comparison of Heuristics for Optimization of Association Rules
Comparison of Heuristics for Optimization of Association Rules
复制标题
DOI：
10.3233/fi-2019-1791
复制
发表时间：
2019-01-01
影响因子：
0.8
通讯作者：
Zabinski, Krzysztof
中科院分区：
文献类型：
--
作者：
Alsolami, Fawaz;Amin, Talha;Zabinski, Krzysztof
本文从构建规则的长度和覆盖范围的角度，比较了7种构建关联规则的贪心启发式算法。并将所得规则与动态规划算法构造的最优规则进行了比较。最佳启发式算法构建的规则长度与最小规则长度的平均相对差不超过4%。覆盖面也是如此。
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.