Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 1-14 |
Number of pages | 14 |
Journal | Fundamenta Informaticae |
Volume | 166 |
Issue number | 1 |
DOIs | |
State | Published - Mar 22 2019 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledgements: Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST) and University of Silesia in Katowice.