FedIERF: Federated Incremental Extremely Random Forest for Wearable Health Monitoring

IF 1.2 3区 计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Chun-Yu Hu, Li-Sha Hu, Lin Yuan, Dian-Jie Lu, Lei Lyu, Yi-Qiang Chen
{"title":"FedIERF: Federated Incremental Extremely Random Forest for Wearable Health Monitoring","authors":"Chun-Yu Hu, Li-Sha Hu, Lin Yuan, Dian-Jie Lu, Lei Lyu, Yi-Qiang Chen","doi":"10.1007/s11390-023-3009-0","DOIUrl":null,"url":null,"abstract":"<p>Wearable health monitoring is a crucial technical tool that offers early warning for chronic diseases due to its superior portability and low power consumption. However, most wearable health data is distributed across different organizations, such as hospitals, research institutes, and companies, and can only be accessed by the owners of the data in compliance with data privacy regulations. The first challenge addressed in this paper is communicating in a privacy-preserving manner among different organizations. The second technical challenge is handling the dynamic expansion of the federation without model retraining. To address the first challenge, we propose a horizontal federated learning method called Federated Extremely Random Forest (FedERF). Its contribution-based splitting score computing mechanism significantly mitigates the impact of privacy protection constraints on model performance. Based on FedERF, we present a federated incremental learning method called Federated Incremental Extremely Random Forest (FedIERF) to address the second technical challenge. FedIERF introduces a hardness-driven weighting mechanism and an importance-based updating scheme to update the existing federated model incrementally. The experiments show that FedERF achieves comparable performance with non-federated methods, and FedIERF effectively addresses the dynamic expansion of the federation. This opens up opportunities for cooperation between different organizations in wearable health monitoring.</p>","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11390-023-3009-0","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Wearable health monitoring is a crucial technical tool that offers early warning for chronic diseases due to its superior portability and low power consumption. However, most wearable health data is distributed across different organizations, such as hospitals, research institutes, and companies, and can only be accessed by the owners of the data in compliance with data privacy regulations. The first challenge addressed in this paper is communicating in a privacy-preserving manner among different organizations. The second technical challenge is handling the dynamic expansion of the federation without model retraining. To address the first challenge, we propose a horizontal federated learning method called Federated Extremely Random Forest (FedERF). Its contribution-based splitting score computing mechanism significantly mitigates the impact of privacy protection constraints on model performance. Based on FedERF, we present a federated incremental learning method called Federated Incremental Extremely Random Forest (FedIERF) to address the second technical challenge. FedIERF introduces a hardness-driven weighting mechanism and an importance-based updating scheme to update the existing federated model incrementally. The experiments show that FedERF achieves comparable performance with non-federated methods, and FedIERF effectively addresses the dynamic expansion of the federation. This opens up opportunities for cooperation between different organizations in wearable health monitoring.

FedIERF:可穿戴健康监测的联邦增量极度随机森林
可穿戴式健康监测由于其优越的便携性和低功耗,是慢性病早期预警的关键技术工具。然而,大多数可穿戴健康数据分布在不同的组织中,如医院、研究机构和公司,并且只能由数据所有者根据数据隐私法规进行访问。本文解决的第一个挑战是在不同组织之间以保护隐私的方式进行通信。第二个技术挑战是在没有模型再培训的情况下处理联邦的动态扩展。为了解决第一个挑战,我们提出了一种称为联邦极端随机森林(FedERF)的水平联邦学习方法。其基于贡献的分分计算机制显著减轻了隐私保护约束对模型性能的影响。在FedERF的基础上,我们提出了一种叫做联邦增量极度随机森林(federdierf)的联邦增量学习方法来解决第二个技术难题。FedIERF引入了一种硬度驱动的加权机制和一种基于重要性的更新方案,以增量方式更新现有的联邦模型。实验表明,FedIERF与非联邦方法的性能相当,有效地解决了联邦的动态扩展问题。这为不同组织在可穿戴健康监测方面的合作提供了机会。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Computer Science and Technology
Journal of Computer Science and Technology 工程技术-计算机:软件工程
CiteScore
4.00
自引率
0.00%
发文量
2255
审稿时长
9.8 months
期刊介绍: Journal of Computer Science and Technology (JCST), the first English language journal in the computer field published in China, is an international forum for scientists and engineers involved in all aspects of computer science and technology to publish high quality and refereed papers. Papers reporting original research and innovative applications from all parts of the world are welcome. Papers for publication in the journal are selected through rigorous peer review, to ensure originality, timeliness, relevance, and readability. While the journal emphasizes the publication of previously unpublished materials, selected conference papers with exceptional merit that require wider exposure are, at the discretion of the editors, also published, provided they meet the journal''s peer review standards. The journal also seeks clearly written survey and review articles from experts in the field, to promote insightful understanding of the state-of-the-art and technology trends. Topics covered by Journal of Computer Science and Technology include but are not limited to: -Computer Architecture and Systems -Artificial Intelligence and Pattern Recognition -Computer Networks and Distributed Computing -Computer Graphics and Multimedia -Software Systems -Data Management and Data Mining -Theory and Algorithms -Emerging Areas
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信