A method for query top-K rules from class association rule set

Abstract

Methods for mining/querying Top-k frequent patterns and Top-k association rules have been developed in recent years. However, methods for mining/querying Top-k rules from a set of class association rules have not been developed. In this paper, we propose a method for querying Top-k class association rules based on the support. From the set of mined class association rules that satisfy the minimum support and minimum confidence thresholds, we use an insertion-based method to query Top-k rules. Firstly, we insert k rules from the rule set to the result set. After that, for each rule in the rest, we insert it into the result rule set using the idea of insertion strategy if its support is greater than the support of the last rule in the result rule set. Experimental results show that the proposed method is more efficient than obtaining the result after sorting the whole rule set.