Xiaochuan Tang , Yu Wang , Xin Liu , Xiaojun Yuan , Chao Fan , Yanmei Hu , Qiang Miao
{"title":"Federated graph neural network for privacy-preserved supply chain data sharing","authors":"Xiaochuan Tang , Yu Wang , Xin Liu , Xiaojun Yuan , Chao Fan , Yanmei Hu , Qiang Miao","doi":"10.1016/j.asoc.2024.112475","DOIUrl":null,"url":null,"abstract":"<div><div>Machine learning plays an increasingly important role in supply chain management. Due to privacy and security concerns, enterprises are reluctant to share their raw data, which leads to missing links in supply chains. To address privacy issue and promote data sharing in supply chain, we propose a new federated graph neural network named Isomorphic Federated Graph Neural Network (IFGNN) for supply chain data sharing. IFGNN consists of a server and multiple clients. The server is a lightweight parameter server with an efficient parameter updating algorithm. A client is assigned to each node in the supply chain network. Every supplier client is linked to its first-order neighbors, which means they have supply–demand relationship. The topology of the input network is identical to that of the supplier clients. Experimental results on a newly collected vehicle supply chain dataset show that the performance of IFGNN is close to its centralized counterpart. This work demonstrates that it is feasible to protect supply chain data privacy without a significant loss of prediction accuracy. Federated learning provides a new solution for promoting data sharing and collaborative machine learning in supply chain.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"168 ","pages":"Article 112475"},"PeriodicalIF":7.2000,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624012493","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Machine learning plays an increasingly important role in supply chain management. Due to privacy and security concerns, enterprises are reluctant to share their raw data, which leads to missing links in supply chains. To address privacy issue and promote data sharing in supply chain, we propose a new federated graph neural network named Isomorphic Federated Graph Neural Network (IFGNN) for supply chain data sharing. IFGNN consists of a server and multiple clients. The server is a lightweight parameter server with an efficient parameter updating algorithm. A client is assigned to each node in the supply chain network. Every supplier client is linked to its first-order neighbors, which means they have supply–demand relationship. The topology of the input network is identical to that of the supplier clients. Experimental results on a newly collected vehicle supply chain dataset show that the performance of IFGNN is close to its centralized counterpart. This work demonstrates that it is feasible to protect supply chain data privacy without a significant loss of prediction accuracy. Federated learning provides a new solution for promoting data sharing and collaborative machine learning in supply chain.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.