SETM*-MaxK: An Efficient SET-Based Approach to Find the Largest Itemset

Abstract

In this paper, we propose the SETM*-MaxK algorithm to find the largest itemset based on a high-level set-based approach, where a large itemset is a set of items appearing in a sufficient number of transactions. The advantage of the set-based approach, like the SETM algorithm, is simple and stable over the range of parameter values. In the SETM*-MaxK algorithm, we efficiently find the L _k based on L _w , where L _k denotes the set of large k-itemsets with minimum support, $L_k \ne \not 0,L_{k + 1} = \not 0{\mathbf{ }}and{\mathbf{ }}w = 2^{\left\lceil {log_2 k} \right\rceil - 1}$ , instead of step by step. From our simulation, we show that the proposed SETM*-MaxK algorithm requires shorter time to achieve its goal than the SETM algorithm.