...
首页> 外文期刊>Concurrency and computation: practice and experience >A new closed frequent itemset mining algorithm based on GPUrnand improved vertical structure
【24h】

A new closed frequent itemset mining algorithm based on GPUrnand improved vertical structure

机译:基于GPUrn和改进垂直结构的封闭频繁项目集挖掘新算法。

获取原文
获取原文并翻译 | 示例
           

摘要

Vertical data structure is very important for closed frequent itemset mining. All closed frequent itemsetsrncan be found by simply using the operations of AND/OR. However, it consumes a large amount of storagernspace, especially in the case of large-size dataset. This paper proposes an algorithm for mining closedrnfrequent itemsets based on a new vertical data structure. The proposed data structure is helpful to save storagernspace by using a multi-layer index. At the same time, numerous CPU and graphics processing unit canrnbe employed in parallel to achieve high-efficiency computing. Especially when dealing with large datasets,rnthe proposed algorithm can obtain a high-speed computing with the help of graphics processing unit. Thernimproved vertical structure reduces the storage space of the data. The experimental results show that our proposedrnalgorithm requires much less computation time than other related methods. Copyright © 2016 JohnrnWiley & Sons, Ltd.
机译:垂直数据结构对于频繁的封闭项集挖掘非常重要。只需使用AND / OR运算就可以找到所有关闭的频繁项目集。但是,它会消耗大量的存储空间,尤其是在大型数据集的情况下。提出了一种基于新的垂直数据结构的封闭式频繁项目集挖掘算法。所提出的数据结构有助于通过使用多层索引来节省存储空间。同时,可以并行使用大量CPU和图形处理单元以实现高效计算。特别是在处理大型数据集时,该算法可以借助图形处理单元实现高速计算。改进的垂直结构减少了数据的存储空间。实验结果表明,我们提出的算法比其他相关方法所需的计算时间少得多。版权所有©2016 JohnrnWiley&Sons,Ltd.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号