【24h】

Frequent itemset mining on hadoop

机译:Hadoop上频繁的项目集挖掘

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

摘要

One of the most important problems in data mining is frequent itemset mining. It requires very large computation and I/O traffic capacity. For that reason several parallel and distributed mining algorithms were developed. Recently the mapreduce distributed data processing paradigm is unavoidable and porting the current algorithms to mapreduce is in focus. In this paper a substantial frequent itemset mining algorithms and their mapreduce implementations are introduced and investi-gated. An algorithm improvement is also proposed and analyzed.
机译:数据挖掘中最重要的问题之一是频繁的项目集挖掘。它需要非常大的计算量和I / O流量。因此,开发了几种并行和分布式挖掘算法。最近,mapreduce分布式数据处理范例是不可避免的,将当前算法移植到mapreduce成为重点。在本文中,介绍并研究了大量的频繁项集挖掘算法及其mapreduce实现。还提出并分析了算法改进。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号