中文摘要：

Apriori算法是经典的关联规则挖掘算法,主要缺点是可能产生大量的候选集和需要多次扫描数据库.从幂集运算的角度提出了一种新的关联规则挖掘算法P_DM算法,实现了只需要扫描一次数据库就产生所有频繁集.实验证明这种算法在中小规模数据挖掘上效率优于Apriori算法.

英文摘要：

Apriori algorithm is a classical association rule mining algorithm,The main disadvantage is likely to produce a large number of candidate sets and require multiple scanning database.Based on the power set operation angle,the paper put forward a new association rule mining algorithm P_DM algorithm,which realize to scan the database once can generate all frequent item sets.The experiment proves that efficiency of algorithm is better than the Apriori algorithm＇s in data mining of medium and small scale.