Using HMT and HASH_TREE to Optimize Apriori Algorithm

摘要

On the basis of deep analysis to the Apriori algorithm. In this paper, the HMT (HASH MAPPING TABLE) and HASH_TREE methodologies are used to optimize space complexity and time complexity. Using the HMT compressed Item sets, HASH_TREE can decentralize support count process. The result of experimental show that, space complexity and time complexity of Apriori algorithm is Efficiency reduced by using HMT and HASH_TREE.