| 关联规则的并行优化挖掘算法 |
| |
| 引用本文： | 杨泽民. 关联规则的并行优化挖掘算法[J]. 中北大学学报(自然科学版), 2007, 28(5): 417-421 |
| |
| 作者姓名： | 杨泽民 |
| |
| 作者单位： | 山西大同大学,计算中心,山西,大同,037009 |
| |
| 基金项目： | 山西大同大学校科研和教改项目 |
| |
| 摘 要： | 传统的关联规则并行挖掘算法中存在着产生大量的候选项集和通信量高的缺点,本文在分析已有并行挖掘关联规则算法的优缺点的基础上,提出了一个效率较高的并行优化关联规则挖掘算法EPMAR(Efficient Parallel Mining Association Rules),并与其它相应的算法进行了比较.实验结果证明:算法EPMAR是有效的,具有一定的扩展性.
|
| 关 键 词： | 数据挖掘 关联规则 并行算法 |
| 文章编号： | 1673-3193（2007）05-0417-05 |
| 收稿时间： | 2006-12-20 |
| 修稿时间： | 2006-12-20 |
An Efficient Parallel Algorithm for Mining Association Rules |
| |
| YANG Ze-ming. An Efficient Parallel Algorithm for Mining Association Rules[J]. Journal of North University of China, 2007, 28(5): 417-421 |
| |
| Authors: | YANG Ze-ming |
| |
| Affiliation: | Computer Centre, Shanxi Datong University, Datong 037009, China |
| |
| Abstract: | There are disadvantages of producing vast candidate items set and correspondence for the traditional Parallel Algorithm for Mining Association Rules running synchronously.One comparative efficient parallel algorithm for mining association rules-YPRAM based on analysis of the advantage and disadvantage of the existing parallel mining algorithms is presented.Comparison with other parallel algorithms is also carried out.The experiments show that YPMAR is efficient and has certain expansibility. |
| |
| Keywords: | data mining association rules parallel algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
