An Efficient Hash-Based Algorithm for Mining Frequent Closed Itemsets

摘要

The frequent itemsets are the main step in the association rule mining, frequent closed itemset tend to be a condensed representation method for frequent itemsets which have smaller set but carry the power similar to the frequent itemsets, and remove redundant rules. This study employs hashing technique to improve one of the most basic algorithms used in this area. The results of the implementation of the new algorithm shows that it is more efficient as far as execution time is concerned.