云制造环境下基于Mahout的并行频繁模式生长算法优化

Jie Wang, Yu Zeng
{"title":"云制造环境下基于Mahout的并行频繁模式生长算法优化","authors":"Jie Wang, Yu Zeng","doi":"10.1109/ISCID.2014.258","DOIUrl":null,"url":null,"abstract":"In cloud manufacturing environment, many manufacturing enterprises will produce massive data of a variety of forms. We do research of optimization parallel frequent pattern mining algorithm based on Mahout in this paper. We first analyze the implement and defects of PFP-Growth in Mahout. Then we propose two optimization strategies. One is parallel sequence optimization, and another is optimization the storage of counting information. Datasets from real manufacturing and Webdocs show the effectiveness of the strategy in time and space of the optimization.","PeriodicalId":385391,"journal":{"name":"2014 Seventh International Symposium on Computational Intelligence and Design","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Optimization of Parallel Frequent Pattern Growth Algorithm Based on Mahout in Cloud Manufacturing Environment\",\"authors\":\"Jie Wang, Yu Zeng\",\"doi\":\"10.1109/ISCID.2014.258\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cloud manufacturing environment, many manufacturing enterprises will produce massive data of a variety of forms. We do research of optimization parallel frequent pattern mining algorithm based on Mahout in this paper. We first analyze the implement and defects of PFP-Growth in Mahout. Then we propose two optimization strategies. One is parallel sequence optimization, and another is optimization the storage of counting information. Datasets from real manufacturing and Webdocs show the effectiveness of the strategy in time and space of the optimization.\",\"PeriodicalId\":385391,\"journal\":{\"name\":\"2014 Seventh International Symposium on Computational Intelligence and Design\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Seventh International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2014.258\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2014.258","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在云制造环境下,许多制造企业将产生各种形式的海量数据。本文对基于Mahout的并行频繁模式挖掘算法进行了优化研究。我们首先分析了在Mahout中PFP-Growth的实现和缺陷。然后提出了两种优化策略。一种是并行序列优化,另一种是计数信息存储优化。来自实际制造业和Webdocs的数据集显示了该策略在时间和空间上的优化有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Optimization of Parallel Frequent Pattern Growth Algorithm Based on Mahout in Cloud Manufacturing Environment
In cloud manufacturing environment, many manufacturing enterprises will produce massive data of a variety of forms. We do research of optimization parallel frequent pattern mining algorithm based on Mahout in this paper. We first analyze the implement and defects of PFP-Growth in Mahout. Then we propose two optimization strategies. One is parallel sequence optimization, and another is optimization the storage of counting information. Datasets from real manufacturing and Webdocs show the effectiveness of the strategy in time and space of the optimization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信