摘要： 文章以DHP算法为基础，在产生频繁项集时考虑了一种可以直接删除非频繁项集的散列函数，并压缩了文中提出的几种冗余事务，提出了FDHP算法，其性能优于传统的Apriori算法和DHP算法。

关键词: 关联规则, 数据挖掘, 频繁项集, DHP算法

Abstract: In this paper, an algorithm based on DHP algorithm for mining association rules in the transaction dtabase, FDHP algorithm is presented. As generating the frequent itemsets, the algorithm considers one hash method pruning the itemsets which are not frequent directly, compressing the redundant transactions denoted in the paper. The performance of the algorithm is better than the conventional Apriori algorithm and the DHP algorithm.

中图分类号: 

• TP311.13