Support-Less Association Rule Mining Using Tuple Count Cube

Abstract

Association rule mining is one of the important tasks in data mining and knowledge discovery (KDD). The traditional task of association rule mining is to find all the rules with high support and high confidence. In some applications, we are interested in finding high confidence rules even though the support may be low. This type of problem differs from the traditional association rule mining problem; hence, it is called support-less association rule mining. Existing algorithms for association rule mining, such as the Apriori algorithm, cannot be used efficiently for support-less association rule mining since those algorithms mostly rely on identifying frequent item-sets with high support. In this paper, we propose a new model to perform support-less association rule mining, i.e., to derive high confidence rules regardless of their support level. A vertical data structure, the Peano Count Tree (P-tree), is used in our model to represent all the information we need. Based on the P-tree structure, we build a special data cube, called the Tuple Count Cube (T-cube), to derive high confidence rules. Data cube operations, such as roll-up, on T-cube, provide efficient ways to calculate the count information needed for support-less association rule mining.