| Algorithm 3: Coverage based rule merging algorithm |
Input: List (rule) | |
Output: Sequence (item) | |
1 | Traverse every item in List (rule) as r |
2 | Merge each item i in antecedent in List (rules) with the summation of their coverage c |
3 | Store m < i, c > in M |
4 | Sort M in descending order of the values |
5 | Return the keys in M as Sequence (item) |