Secure Interaction-based Feature Selection for Vertical Federated Learning

被引:0
作者
Meng, Zhenyu [1 ]
Zhang, Wenmiao [1 ]
Shen, Shuaiqi [2 ]
Yu, Chong [3 ]
Zhang, Kuan [1 ]
机构
[1] Univ Nebraska, Dept Elect & Comp Engn, Lincoln, NE 68588 USA
[2] Univ Wisconsin, Dept Elect Engn, Milwaukee, WI 53201 USA
[3] Univ Cincinnati, Dept Comp Sci, Cincinnati, OH USA
来源
ICC 2024 - IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS | 2024年
关键词
Vertical federated learning; feature selection; feature interactions; privacy-preserving;
D O I
10.1109/ICC51166.2024.10622749
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Federated learning enables decentralized data owners to collaborate and train models in a distributed manner. A special type is Vertical Federated Learning (VFL), where each of the participated data owners only has a portion of the data features. To maintain a high accuracy and reasonable computational cost, selecting a set of features among the entire dataset is essential. Although some existing work selects features by calculating their individual contributions to the learning outcomes, knowing the joint contribution from multiple features becomes necessary but challenging. Meanwhile, security concerns are raised when calculating the joint contribution of a set of features where the feature data are stored by different owners. Using homomorphic encryption or secure computing over encrypted data is possible, but it may cost too much when complex calculations are involved and repeated. To this end, this paper proposes a privacy-preserving feature selection protocol that considers the interactions between features stored across different data owners. Specifically, we first propose an interaction-based feature selection algorithm for vertically distributed datasets. This algorithm estimates the features' joint contributions to the model training outcomes. Then, we propose a privacy-preservation protocol to prevent the semi-honest cloud server from obtaining or inferring the raw data when aggregating the knowledge and calculating the complex interaction measure for feature selection. We create a new approximation method for interaction measures to address the high computational cost when securely calculating the interaction measure while maintaining the training accuracy. The security discussions show that the proposed protocol preserves data owner's privacy. The extensive simulations validate the achieved training accuracy and efficiency.
引用
收藏
页码:4608 / 4613
页数:6
相关论文
共 13 条
[1]  
Anuar Norsyahirah Khairul, 2020, 2020 8th International Conference on Information Technology and Multimedia (ICIMU), P108, DOI 10.1109/ICIMU49871.2020.9243355
[2]   USING MUTUAL INFORMATION FOR SELECTING FEATURES IN SUPERVISED NEURAL-NET LEARNING [J].
BATTITI, R .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (04) :537-550
[3]  
Brakerski Zvika, 2014, ACM Transactions on Computation Theory, V6, DOI 10.1145/2633600
[4]  
Li Anran, 2023, IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, P1, DOI 10.1109/INFOCOM53939.2023.10228895
[5]  
Li Xiling, 2021, P INT C MACH LEARN, P6326
[6]   Trust-Based Route Planning for Automated Vehicles [J].
Sheng, Shili ;
Pakdamanian, Erfan ;
Han, Kyungtae ;
Wang, Ziran ;
Lenneman, John ;
Feng, Lu .
ICCPS'21: PROCEEDINGS OF THE 2021 ACM/IEEE 12TH INTERNATIONAL CONFERENCE ON CYBER-PHYSICAL SYSTEMS (WITH CPS-IOT WEEK 2021), 2021, :1-10
[7]  
Yang J, 2014, IEEE IJCNN, P4182, DOI 10.1109/IJCNN.2014.6889613
[8]  
Ye XC, 2019, PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P4142
[9]   Efficient Multi-Layer Stochastic Gradient Descent Algorithm for Federated Learning in E-health [J].
Yu, Chong ;
Shen, Shuaiqi ;
Wang, Shiqiang ;
Zhang, Kuan ;
Zhao, Hai .
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, :1263-1268
[10]   A novel feature selection method considering feature interaction [J].
Zeng, Zilin ;
Zhang, Hongjun ;
Zhang, Rui ;
Yin, Chengxiang .
PATTERN RECOGNITION, 2015, 48 (08) :2656-2666