Research of frequent itemsets mining algorithm based on 0-1 matrix
Yueqin Zhang · Jisuanji gongcheng yu sheji · 2009
In view of the association rule mining technology and its classic Apriori algorithm research and analysis, combined with the existence of the algorithm, frequent itemsets mining algorithm based on 0-1 matrix is proposed. The new algorithm only needs to scan whole database once, and efficiently reduces the I/O time. Through direct support of the matrix by the vector-line operations and to identify frequent sets, it simplifies the join step and the prune step in Apriori algorithm, and improves operating efficiency. Also it reduces the support matrix unceasingly to reduce the higher mode frequent collection excavation time and save the storage space. Finally, the experimental results show the proposed method is effective.