采掘关联规则的高效并行算法  

AN EFFICIENT PARALLEL ALGORITHM FOR MINING ASSOCIATION RULES

作　　者：铁治欣[1] 陈奇[1] 俞瑞钊[1] 

机构地区：[1]浙江大学人工智能研究所

出　　处：《计算机研究与发展》1999年第8期948-953,共6页Journal of Computer Research and Development

摘　　要：采掘关联规则是数据采掘领域的一个重要问题．文中对采掘关联规则问题进行了简单的回顾；给出了一种提高顺序采掘关联规则效率的方法；分析了已有并行采掘关联规则算法的优缺点；设计了一个效率较高的并行采掘关联规则的算法ＰＭＡＲ；并与其它相应算法进行了比较．实验证明，算法ＰＭＡＲ是有效的．Mining association rules is an important data mining problem. The problem of mining association rules is simply reviewed in the paper here. A method to improve efficiency of sequential mining association rules is given. The advantage and disadvantage of the existing parallel mining algorithms are analyzed. A more efficient parallel algorithm for mining association rules PMAR is presented. Comparison with other parallel algorithms is carried out. The experiments show that PMAR is efficient.

关 键 词：数据采掘 关联规则 并行算法 数据库 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]