期刊文献+

一种基于图形处理器的频繁模式挖掘算法 被引量:6

GPU-based frequent pattern mining algorithm
下载PDF
导出
摘要 频繁模式挖掘是数据挖掘的核心问题。传统上,频繁模式并行挖掘主要是在集群上进行的,较少涉及共享内存多处理系统上的并行挖掘。基于广度优先搜索和直接计数策略研究了一种并行挖掘方法,并在图形处理器(graphics processing unit,GPU)最新统一计算设备架构CUDA(compute unified device architecture)下进行了实现。GPU-based FPMA用CPU控制搜索进程;在GPU的多处理器上,采用数据划分的计算策略,以适合GPU的顺序数据流方式计数,并根据候选项的长度动态剪枝事务数据集。实验结果表明,GPU-based FPMA比CPU版本平均加速了10倍以上。 Frequent pattern mining is an important issue in data mining area. Traditionally, parallel frequent pattern mining is carried out in PC clusters, and seldom related to multi-processors or massive cores with shared memories. In this paper, we propose a parallel frequent pattern mining algorithm suitable for GPU (graphics processing unit) based on width search and direct support strategy. It is implemented under compute unified device architecture (CUDA) of GPU. In this algorithm, CPU takes charge of search process and GPU is responsible for counting using data partition. In addition, transactions are dynamically pruned according to the length (k) of candidate frequent itemsets. Performance analysis shows that GPU-based FPMA reaches an average speed as fast as that of 10 times of CPU-based counterpart.
出处 《仪器仪表学报》 EI CAS CSCD 北大核心 2009年第10期2082-2087,共6页 Chinese Journal of Scientific Instrument
基金 国家自然科学基金重大项目(60496320 60496321) 国家自然科学基金(60773097 60873148)资助项目
关键词 关联规则 频繁模式 图形处理器 并行计算 统一计算设备架构 association rule frequent pattern GPU parallel computing CUDA
  • 相关文献

参考文献5

二级参考文献36

  • 1吴恩华,柳有权.基于图形处理器(GPU)的通用计算[J].计算机辅助设计与图形学学报,2004,16(5):601-612. 被引量:226
  • 2陆介平,杨明,孙志挥,鞠时光.快速挖掘全局最大频繁项目集[J].软件学报,2005,16(4):553-560. 被引量:27
  • 3阮幼林,李庆华,刘干.分布环境中的并行频繁模式挖掘算法[J].计算机工程与应用,2005,41(25):1-3. 被引量:3
  • 4[1]Agrawal R., Imielinski T., Swami A.. Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D. C. , USA, 1993, 207~216
  • 5[2]Lin D-I. , Kedem Z. M.. Pincer-search: A new algorithm for discovering the maximum frequent set. In: Proceedings of the 6th International Conference on Extending Database Technology, Valencia, Spain, 1998, 105~119
  • 6[3]Bayardo R. J.. Efficiently mining long patterns from databases.In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA,1998, 85~93
  • 7[4]Aggarwal C. , Agarwal R. , Prasad V. V. V.. Depth first generation of long patterns. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Boston, MA, USA, 2000, 108~118
  • 8[5]Burdick D. , Calimlim M. , Gehrke J.. MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, 2001, 443~452
  • 9[6]Agrawal R. , Srikant R.. Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, 1994, 487~499
  • 10[7]Liu Jun-Qiang, Pan Yun-He, Wang Ke, Han Jia-Wei. Mining frequent item sets by opportunistic projection. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Alberta, Canada, 2002, 229~238

共引文献170

同被引文献82

引证文献6

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部