【摘要】 针对关联规则中Apriori算法反复扫描数据库以及运算效率低的问题,提出了一种基于Hash表的二进制编码改进的Apriori算法HBE-Apriori (Hashed Binary Encode).该算法通过Hash表保存事务数据库,因此只需要扫描一次数据库,从而避免了传统Apriori算法反复扫描数据库带来的时间消耗;通过引入与运算对项集二进制编码进行运算,以达到了节省了存储空间的效果,同时提升了算法的执行效率.论文最后,通过举例和实验分析对比,证明了所提出的算法具有可行性和更好地运算效率.更多还原

【Abstract】 An improved Apriori algorithm HBE-Apriori(Hashed Binary Encode) based on hash table is proposed to solve the problem of repeatedly scanning database and low efficiency of Apriori algorithm in association rules in this paper.The algorithm saves the transaction database through Hash table so that it only needs to scan the database once to avoid the time consumption caused by the traditional Apriori algorithm repeatedly scanning the database;and the algorithm uses AND operation to calculate the binary code of item set,which can save the storage space and improve the efficiency of the algorithm.The example and experiments prove the algorithm proposed in the paper is feasible and efficient.更多还原