Author
Listed:
- Zihan Guo
(School of Intelligent Systems Engineering, Sun Yat-Sen University, Shenzhen 518107, China)
- Linlin You
(School of Intelligent Systems Engineering, Sun Yat-Sen University, Shenzhen 518107, China)
- Sheng Liu
(School of Intelligent Systems Engineering, Sun Yat-Sen University, Shenzhen 518107, China)
- Junshu He
(School of Intelligent Systems Engineering, Sun Yat-Sen University, Shenzhen 518107, China)
- Bingran Zuo
(Rehabilitation Research Institute of Singapore, Nanyang Technological University, Singapore 639798, Singapore)
Abstract
Driver distraction detection (3D) is essential in improving the efficiency and safety of transportation systems. Considering the requirements for user privacy and the phenomenon of data growth in real-world scenarios, existing methods are insufficient to address four emerging challenges, i.e., data accumulation, communication optimization, data heterogeneity, and device heterogeneity. This paper presents an incremental and cost-efficient mechanism based on federated meta-learning, called ICMFed, to support the tasks of 3D by addressing the four challenges. In particular, it designs a temporal factor associated with local training batches to stabilize the local model training, introduces gradient filters of each model layer to optimize the client–server interaction, implements a normalized weight vector to enhance the global model aggregation process, and supports rapid personalization for each user by adapting the learned global meta-model. According to the evaluation made based on the standard dataset, ICMFed can outperform three baselines in training two common models (i.e., DenseNet and EfficientNet) with average accuracy improved by about 141.42%, training time saved by about 54.80%, communication cost reduced by about 54.94%, and service quality improved by about 96.86%.
Suggested Citation
Zihan Guo & Linlin You & Sheng Liu & Junshu He & Bingran Zuo, 2023.
"ICMFed: An Incremental and Cost-Efficient Mechanism of Federated Meta-Learning for Driver Distraction Detection,"
Mathematics, MDPI, vol. 11(8), pages 1-22, April.
Handle:
RePEc:gam:jmathe:v:11:y:2023:i:8:p:1867-:d:1123581
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:8:p:1867-:d:1123581. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.