A Privacy Frequent Itemsets Mining Framework for Collaboration in IoT Using Federated Learning

Author:

Wu Jimmy Ming-Tai1ORCID,Teng Qian1ORCID,Huda Shamsul2ORCID,Chen Yeh-Cheng3ORCID,Chen Chien-Ming1ORCID

Affiliation:

1. Shandong University of Science and Technology, Qingdao City, Shandong Province, China

2. School of Information Technology, Deakin University, Melbourne, Australia

3. Department of Computer Science, University of California, Davis, USA

Abstract

Rapid advancement of industrial internet of things (IoT) technology has changed the supply chain network to an open system to meet the high demand for individualized products and provide better customer experiences. However the open-system supply chain has forced many small and midsize enterprises (SMEs) to adopt vertical integration by being divided into smaller companies with a distinctive business for each SME but a central alliance to produce a range of products and gain competencies. Therefore, existing models do not guarantee the protection of data privacy of individual SMEs. Moreover, especially for the IoT environment, collecting data in a secure way and revealing valuable knowledge in an IoT network is difficult. How to share data in a secure framework is of paramount importance in the internet of behavior field. In this article, a privacy-preserving data-mining framework is proposed for joint-venture industrial collaborative activities by combining federated learning and a “pre-large concept” of data-mining techniques. The novelty of the proposed approach is that, while mining high-utility itemsets (HUIs) from multiple datasets, it does not require direct data sharing. In the proposed method, the federated-learning framework can learn from aggregated learning parameters without scanning all data from different sets. The pre-large concept in this approach reduces the amount of scanning into different datasets. Thus, the approach makes it possible to train federated learning more quickly while protecting the privacy of individual data owners. The approach has been tested on real industrial datasets in a collaborative environment. Extensive experimental results show that the approach achieves high accuracy compared with conventional data-mining techniques while preserving the privacy of datasets.

Funder

Shandong Provincial Natural Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference33 articles.

1. Rakesh Agarwal and Ramakrishnan Srikant. 1994. Fast algorithms for mining association rules. In Proceedings of the 1994 International Conference on Very Large Data Bases. 487–499.

2. Mining association rules between sets of items in large databases

3. OHUQI: Mining on-shelf high-utility quantitative itemsets;Chen Lili;The Journal of Supercomputing,2022

4. A New Fast Vertical Method for Mining Frequent Patterns

5. A new algorithm for fast mining frequent itemsets using N-lists

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3