摘要： 提出了一个基于最小完美哈希函数的关联规则的挖掘算法。基于Apriori的算法，在综合了传统哈希剪枝技术的同时，利用最小完美哈希函数的优点，保证了静态数据库关联规则挖掘，可以对关联规则的哈希结构数据进行动态的调整。该算法提高了挖掘效率，通过抑制哈希地址冲突提高了算法的稳定性和可用性。

关键词: 数据挖掘, 入侵检测, 关联规则, 最小完美哈希函数

Abstract: This paper proposes an optimized direct Hash and pruning algorithm based on minimal perfect Hash scheme. This algorithm based on Apriori, integrates the advantages of conventional Hash pruning technique and those of minimal perfect Hash scheme. Besides dealing with mining association rules of static database, this algorithm also perform greatly in updating Hash structure. This algorithm improves the efficiency of mining, stability and availability by restraining the Hash address conflict. The experiments show that ODHP can be more efficient than conventional mining algorithm.

Key words: Data mining, Intrusion detection, Association rule, Minimal perfect Hash function

中图分类号: 

• TP312