首页 | 本学科首页   官方微博 | 高级检索  
     

采掘关联规则的高效并行算法
引用本文:铁治欣,陈奇,俞瑞钊. 采掘关联规则的高效并行算法[J]. 计算机研究与发展, 1999, 24(8): 948-953
作者姓名:铁治欣  陈奇  俞瑞钊
作者单位:浙江大学人工智能研究所,杭州,310027
摘    要:采掘关联规则是数据采掘领域的一个重要问题。文中对采掘关联规则问题进行了简单的回顾,给出了一种提高顺序采掘关联规则效率的方法;分析了已有并采掘关联规则算法的优缺点;设计了一个效率较高的并行采掘关联规则的算法PMAR;并与其它相应算法进行了比较,实验证明,算法PMAR是有效的。

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

AN EFFICIENT PARALLEL ALGORITHM FOR MINING ASSOCIATION RULES
TIE Zhi-Xin,CHEN Qi,YU Rui-Zhao. AN EFFICIENT PARALLEL ALGORITHM FOR MINING ASSOCIATION RULES[J]. Journal of Computer Research and Development, 1999, 24(8): 948-953
Authors:TIE Zhi-Xin  CHEN Qi  YU Rui-Zhao
Abstract: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.
Keywords:data mining   association rules   parallel algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号