Wrapper-Based Federated Feature Selection for IoT Environments

被引:3
作者
Mahanipour, Afsaneh [1 ]
Khamfroush, Hana [1 ]
机构
[1] Univ Kentucky, Dept Comp Sci, Lexington, KY 40506 USA
来源
2023 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS, ICNC | 2023年
关键词
Feature selection; Federated Learning; Internet-of-Things; Machine Learning;
D O I
10.1109/ICNC57223.2023.10074296
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Novel Internet of Things (IoT) applications have emerged as enabling technologies for the smart city initiative. IoT devices collect or produce huge multi-modal data that is either processed on the edge or sent to a central cloud for processing. The collected data sets are pre-processed by methods known as "feature selection", to remove redundant, irrelevant, or noisy features. Feature selection will help with improving the results achieved by the learning method as well as reducing the computational complexity of the model. The goal is to select the most informative features of data and only transmit the selected features to the edge/cloud servers for further processing. This leads to smaller costs for data transmission to the servers. In this paper, a novel wrapper-based federated feature selection (FFS) algorithm is proposed, where IoT devices collaborate to select the most informative features without sharing their local data sets. The proposed FFS algorithm uses binary gravitational search algorithm (BGSA) in a federated and collaborative manner to select a small enough subset of informative attributes and provide an improved trade-off between communication cost and learning accuracy. Our experimental results on three data sets including MNIST, Fashion-MNIST, and MAV demonstrate that the proposed BGSAFFS method can in average remove more than 50% of features without losing information. The obtained results prove the effectiveness of the proposed method in achieving a good trade-off between accuracy and communication cost in comparison to other state-of-the-art feature selection methods as well as a no-feature selection baseline.
引用
收藏
页码:214 / 219
页数:6
相关论文
共 12 条
[1]   Metaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019) [J].
Agrawal, Prachi ;
Abutarboush, Hattan F. ;
Ganesh, Talari ;
Mohamed, Ali Wagdy .
IEEE ACCESS, 2021, 9 :26766-26791
[2]  
Cassara P., 2022, IEEE Transactions on Vehicular Technology
[3]  
Chu X., 2020, INT C NEURAL COMPUTI
[4]  
Hu Y., 2022, IEEE Transactions on Artificial Intelligence
[5]  
Konečny J, 2016, Arxiv, DOI arXiv:1610.02527
[6]   Input feature selection for classification problems [J].
Kwak, N ;
Choi, CH .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2002, 13 (01) :143-159
[7]   Federated Learning: Challenges, Methods, and Future Directions [J].
Li, Tian ;
Sahu, Anit Kumar ;
Talwalkar, Ameet ;
Smith, Virginia .
IEEE SIGNAL PROCESSING MAGAZINE, 2020, 37 (03) :50-60
[8]  
Mahanipour A, 2018, 2018 3RD CONFERENCE ON SWARM INTELLIGENCE AND EVOLUTIONARY COMPUTATION (CSIEC2018), VOL 3, P58
[9]  
Nishio T, 2019, IEEE ICC, DOI 10.46660/ijeeg.vol0.iss0.0.82
[10]   BGSA: binary gravitational search algorithm [J].
Rashedi, Esmat ;
Nezamabadi-pour, Hossein ;
Saryazdi, Saeid .
NATURAL COMPUTING, 2010, 9 (03) :727-745