首页> 外文期刊>International Journal of Computer Systems Science & Engineering >A frequent pattern parallel mining algorithm based on distributed sliding window
【24h】

A frequent pattern parallel mining algorithm based on distributed sliding window

机译:基于分布式滑动窗口的频繁模式并行挖掘算法

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

摘要

Cloud computing infrastructure based on Map/Reduce model provided a promising solution to solve Association Rule Mining of large data, but redundancy of candidate sets and low efficiency of frequent pattern mining were still important problems in distributed data mining. A parallel algorithm based on Hadoop cloud computing platform is proposed, which constructs and mines TPT-Tree in distributed nodes and processes intermediate candidate sets with hash structure to accelerate the speed of mining frequent item sets. Experimental results show that this algorithm improves the efficiency of frequent pattern data mining and is with a satisfied speedup.
机译:基于Map / Reduce模型的云计算基础设施为解决大数据的关联规则挖掘提供了一个有前途的解决方案,但是候选集的冗余和频繁模式挖掘的低效率仍然是分布式数据挖掘中的重要问题。提出了一种基于Hadoop云计算平台的并行算法,该算法在分布式节点中构造和挖掘TPT-Tree,并通过哈希结构处理中间候选集,以加快频繁项集的挖掘速度。实验结果表明,该算法提高了频繁模式数据挖掘的效率,并且具有令人满意的加速效果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号