首页> 外文期刊>International journal of internet protocol technology >Deep mining method for high-dimensional big data based on association rule
【24h】

Deep mining method for high-dimensional big data based on association rule

机译:基于关联规则的高维大数据的深挖掘方法

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

摘要

Existing high-dimensional deep data mining methods have the problems of low precision and high energy consumption. Therefore, a deep mining method of high-dimensional big data based on association rules is proposed. Ealat algorithm is used to change the format of high-dimensional large data set. On this basis, MapReduce computing model is introduced to divide parallel tasks into map and reduce phases to realise the construction of operation platform. Hadoop's distributed file system is used to store distributed data. The input and output of the algorithm are converted into the form required by the MapReduce computing model to realise the deep mining of high-dimensional big data. Experimental results show that this method has higher mining accuracy and lower energy consumption. The result of practical application is good.
机译:现有的高维数据挖掘方法具有低精度和高能耗的问题。 因此,提出了一种基于关联规则的高维大数据的深挖掘方法。 Ealat算法用于改变高维大数据集的格式。 在此基础上,引入MapReduce计算模型以将并行任务划分为地图并减少阶段以实现操作平台的构造。 Hadoop的分布式文件系统用于存储分布式数据。 算法的输入和输出转换为MapReduce计算模型所需的表单,以实现高维大数据的深度挖掘。 实验结果表明,该方法具有更高的采矿精度和较低的能耗。 实际应用的结果是好的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号