一种隐藏供应链敏感关联规则的集成方法

IF 2.5 Q2 ENGINEERING, INDUSTRIAL
Hui Cheng, Wenjie Zhang, Zhaoyang Wang, Fengjuan Zuo, Zaifang Zhang
{"title":"一种隐藏供应链敏感关联规则的集成方法","authors":"Hui Cheng,&nbsp;Wenjie Zhang,&nbsp;Zhaoyang Wang,&nbsp;Fengjuan Zuo,&nbsp;Zaifang Zhang","doi":"10.1049/cim2.12026","DOIUrl":null,"url":null,"abstract":"<p>Sensitive association rule hiding is an important issue of data sharing for supply chains, which can ensure mutual benefits and avoid information leakages among different enterprises. An integrated method is proposed by using Apriori and the discrete binary particle swarm optimization (BPSO) algorithm, aiming to improve the rule hiding efficiency and effectiveness. The Apriori algorithm is used to extract the association rules from sharing data. The selected sensitive association rules can be hidden using BPSO based on constructing discrete binary space and multi-objective fitness functions. The proposed method is verified through a case study. The results show that the proposed method can effectively hide sensitive information and protect enterprises' business benefits.</p>","PeriodicalId":33286,"journal":{"name":"IET Collaborative Intelligent Manufacturing","volume":"3 4","pages":"324-333"},"PeriodicalIF":2.5000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cim2.12026","citationCount":"0","resultStr":"{\"title\":\"An integrated method for hiding sensitive association rules of the supply chains\",\"authors\":\"Hui Cheng,&nbsp;Wenjie Zhang,&nbsp;Zhaoyang Wang,&nbsp;Fengjuan Zuo,&nbsp;Zaifang Zhang\",\"doi\":\"10.1049/cim2.12026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Sensitive association rule hiding is an important issue of data sharing for supply chains, which can ensure mutual benefits and avoid information leakages among different enterprises. An integrated method is proposed by using Apriori and the discrete binary particle swarm optimization (BPSO) algorithm, aiming to improve the rule hiding efficiency and effectiveness. The Apriori algorithm is used to extract the association rules from sharing data. The selected sensitive association rules can be hidden using BPSO based on constructing discrete binary space and multi-objective fitness functions. The proposed method is verified through a case study. The results show that the proposed method can effectively hide sensitive information and protect enterprises' business benefits.</p>\",\"PeriodicalId\":33286,\"journal\":{\"name\":\"IET Collaborative Intelligent Manufacturing\",\"volume\":\"3 4\",\"pages\":\"324-333\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cim2.12026\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Collaborative Intelligent Manufacturing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/cim2.12026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, INDUSTRIAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Collaborative Intelligent Manufacturing","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cim2.12026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

摘要

国家自然科学基金项目,批准号:51205242;上海市科技创新行动计划,授予/奖励编号:16111106400摘要敏感关联规则隐藏是供应链数据共享的一个重要问题,它可以确保互利互惠,避免不同企业之间的信息泄漏。为了提高规则隐藏的效率和有效性,提出了一种将Apriori算法与离散二进制粒子群优化算法相结合的方法。Apriori算法用于从共享数据中提取关联规则。基于构造离散二元空间和多目标适应度函数,可以使用BPSO隐藏选定的敏感关联规则。通过实例验证了该方法的有效性。结果表明,该方法能够有效地隐藏敏感信息,保护企业的商业利益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

An integrated method for hiding sensitive association rules of the supply chains

An integrated method for hiding sensitive association rules of the supply chains

Sensitive association rule hiding is an important issue of data sharing for supply chains, which can ensure mutual benefits and avoid information leakages among different enterprises. An integrated method is proposed by using Apriori and the discrete binary particle swarm optimization (BPSO) algorithm, aiming to improve the rule hiding efficiency and effectiveness. The Apriori algorithm is used to extract the association rules from sharing data. The selected sensitive association rules can be hidden using BPSO based on constructing discrete binary space and multi-objective fitness functions. The proposed method is verified through a case study. The results show that the proposed method can effectively hide sensitive information and protect enterprises' business benefits.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Collaborative Intelligent Manufacturing
IET Collaborative Intelligent Manufacturing Engineering-Industrial and Manufacturing Engineering
CiteScore
9.10
自引率
2.40%
发文量
25
审稿时长
20 weeks
期刊介绍: IET Collaborative Intelligent Manufacturing is a Gold Open Access journal that focuses on the development of efficient and adaptive production and distribution systems. It aims to meet the ever-changing market demands by publishing original research on methodologies and techniques for the application of intelligence, data science, and emerging information and communication technologies in various aspects of manufacturing, such as design, modeling, simulation, planning, and optimization of products, processes, production, and assembly. The journal is indexed in COMPENDEX (Elsevier), Directory of Open Access Journals (DOAJ), Emerging Sources Citation Index (Clarivate Analytics), INSPEC (IET), SCOPUS (Elsevier) and Web of Science (Clarivate Analytics).
×
引用
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学术官方微信