{"title":"多实体风电预测的隐私保护图推理网络:一种联邦学习方法","authors":"Xinxin Long;Yizhou Ding;Yuanzheng Li;Yang Li;Liang Gao;Zhigang Zeng","doi":"10.1109/TNSE.2025.3547227","DOIUrl":null,"url":null,"abstract":"Data sharing is considered by many wind farm stakeholders as the cause of privacy issues and further financial risks, despite its potential to enhance the accuracy of multi-entity wind power forecasting (MWPF). Federated learning (FL) serves as a possible solution to preserve the privacy in MWPF, while the existing FL-based methods still struggle to obtain accurate prediction due to the intricate spatial dependencies and heterogeneous temporal dependencies. In response to these two challenges, this paper proposes a collaborative privacy-preserving framework (CPLF) for MWPF. Within the CPLF, a graph learning-based local model named graph inference network (GIN) is developed to learn local features and obtain the global ones through aggregation. In terms of the spatial dependencies, a structure-independent dynamic graph inference (SiDGI) block is designed to extract spatial features via learnable directed graph representation. Regarding the heterogeneous temporal dependencies, the GIN, with its encoder-decoder to distill general temporal pattern, is trained following a customized FL procedure to effectively extract entity-specific temporal features. This customization can mitigate the communication burden and reverse-engineer risks while yielding improvements in MWPF accuracy. Finally, the extensive experiments are implemented based on two datasets collected from the Northwest and Southeast of California. The superiority of the proposed privacy-preserving MWPF method is verified compared with some classical methods. Specially, for graph attention, MWPF achieves 6.8% and 14.9% average improvements in mean absolute percentage error (MAPE).","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2428-2444"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Privacy-Preserving Graph Inference Network for Multi-Entity Wind Power Forecast: A Federated Learning Approach\",\"authors\":\"Xinxin Long;Yizhou Ding;Yuanzheng Li;Yang Li;Liang Gao;Zhigang Zeng\",\"doi\":\"10.1109/TNSE.2025.3547227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data sharing is considered by many wind farm stakeholders as the cause of privacy issues and further financial risks, despite its potential to enhance the accuracy of multi-entity wind power forecasting (MWPF). Federated learning (FL) serves as a possible solution to preserve the privacy in MWPF, while the existing FL-based methods still struggle to obtain accurate prediction due to the intricate spatial dependencies and heterogeneous temporal dependencies. In response to these two challenges, this paper proposes a collaborative privacy-preserving framework (CPLF) for MWPF. Within the CPLF, a graph learning-based local model named graph inference network (GIN) is developed to learn local features and obtain the global ones through aggregation. In terms of the spatial dependencies, a structure-independent dynamic graph inference (SiDGI) block is designed to extract spatial features via learnable directed graph representation. Regarding the heterogeneous temporal dependencies, the GIN, with its encoder-decoder to distill general temporal pattern, is trained following a customized FL procedure to effectively extract entity-specific temporal features. This customization can mitigate the communication burden and reverse-engineer risks while yielding improvements in MWPF accuracy. Finally, the extensive experiments are implemented based on two datasets collected from the Northwest and Southeast of California. The superiority of the proposed privacy-preserving MWPF method is verified compared with some classical methods. Specially, for graph attention, MWPF achieves 6.8% and 14.9% average improvements in mean absolute percentage error (MAPE).\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 4\",\"pages\":\"2428-2444\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-03-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10937051/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10937051/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
Privacy-Preserving Graph Inference Network for Multi-Entity Wind Power Forecast: A Federated Learning Approach
Data sharing is considered by many wind farm stakeholders as the cause of privacy issues and further financial risks, despite its potential to enhance the accuracy of multi-entity wind power forecasting (MWPF). Federated learning (FL) serves as a possible solution to preserve the privacy in MWPF, while the existing FL-based methods still struggle to obtain accurate prediction due to the intricate spatial dependencies and heterogeneous temporal dependencies. In response to these two challenges, this paper proposes a collaborative privacy-preserving framework (CPLF) for MWPF. Within the CPLF, a graph learning-based local model named graph inference network (GIN) is developed to learn local features and obtain the global ones through aggregation. In terms of the spatial dependencies, a structure-independent dynamic graph inference (SiDGI) block is designed to extract spatial features via learnable directed graph representation. Regarding the heterogeneous temporal dependencies, the GIN, with its encoder-decoder to distill general temporal pattern, is trained following a customized FL procedure to effectively extract entity-specific temporal features. This customization can mitigate the communication burden and reverse-engineer risks while yielding improvements in MWPF accuracy. Finally, the extensive experiments are implemented based on two datasets collected from the Northwest and Southeast of California. The superiority of the proposed privacy-preserving MWPF method is verified compared with some classical methods. Specially, for graph attention, MWPF achieves 6.8% and 14.9% average improvements in mean absolute percentage error (MAPE).
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.