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

关联规则挖掘算法的多核并行优化
引用本文:吴华平,郑晓薇,张建强.关联规则挖掘算法的多核并行优化[J].微型机与应用,2011,30(1):4-6,9.
作者姓名:吴华平  郑晓薇  张建强
作者单位:辽宁师范大学,计算机与信息技术学院,辽宁大连116081
基金项目:国家自然科学基金项目(No.60603047)
摘    要:分析了并行关联规则挖掘算法存在的不足,提出了一种改进的关联规则挖掘的多核并行优化算法。该算法对Apriori算法的压缩矩阵进行了改造,并在多核平台下利用OpenMP技术和TBB技术对串行程序进行循环并行化和任务分配的并行化设计,最大限度地实现并行关联规则挖掘。

关 键 词:关联规则  Apriori算法  频繁项集矩阵  OpenMP  TBB  多核并行

Matrix compression based on multi-core TBB parallel algorithms for mining association rules
Wu Huaping,Zheng Xiaowei,Zhang Jianqiang.Matrix compression based on multi-core TBB parallel algorithms for mining association rules[J].Microcomputer & its Applications,2011,30(1):4-6,9.
Authors:Wu Huaping  Zheng Xiaowei  Zhang Jianqiang
Affiliation:Wu Huaping,Zheng Xiaowei,Zhang Jianqiang(College of Computer and Information Technology,Liaoning Normal University,Dalian 116081,China)
Abstract:This paper analyzes the parallel algorithm for mining association rules exist,the paper proposes an improved multi-core parallel association rule mining algorithm.The algorithm transforms the compression matrix of Apriori algorithm,and uses OpenMP and TBB technology under multi-core platform to complish cycle of serial procedures and task allocation in parallel of parallel design,to maximize the parallel association rule mining.
Keywords:association rules  Apriori algorithm  frequent itemsets matrix  OpenMP  TBB  multi-core parallel  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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