摘要
通过分析关联规则中的经典算法Apriori,针对传统Apriori算法效率上的不足,提出一种基于哈希技术的改进Apriori算法,该算法将频繁项集存储在哈希表中,采用线性直接地址法使得哈希表中存储的频繁项集不冲突,提高算法的效率,具有较好的实用性.
This paper introduces the principle and efficiency of the Apriori algorithm which is the typical algorithm about the association rules mining and proposes an improved Apriori algorithm based on hash techniques,which is aimed at the disadvantage of Apriori algorithm.This algorithm store the frequent itemsets into a hashtalbe,which adopts linear address and makes no conflicts between the frequent itemsets in the hashtable.So it can improve the efficient of the algorithm.
出处
《哈尔滨商业大学学报(自然科学版)》
CAS
2010年第6期706-709,共4页
Journal of Harbin University of Commerce:Natural Sciences Edition
基金
黑龙江省自然科学基金(11541083)