A new algorithm for fast mining frequent itemsets based on SO-Sets

N-list and B-list have simply been proven to be highly effective for mining frequent itemsets. The main problem of the two novel structures is that they both need to encode each node of pre-order (or start order) and post-order (or finish order) code. This causes excessive memory consumption to mine frequent itemsets. In this paper, we propose SO-Sets based on SO-Tree, a more efficient data structure, to mine frequent itemsets. SO-Sets require only start-order (or finish-order) of each node, which makes it save lots of memory compared with N-list and B-list. Based on SO-Sets, we propose a new algorithm called FISO to mining frequent itemsets. To analyze the performance of algorithms, we conduct lots of experiments on five real datasets. Experimental results show that FISO algorithm has advantages in running time and size of main memory consumption.