Communication-efficient federated multi-domain learning for network anomaly detection

IF 6.3 2区 计算机科学 Q1 TELECOMMUNICATIONS
Digital Communications and Networks Pub Date : 2026-03-01 Epub Date: 2024-11-22 DOI:10.1016/j.dcan.2024.11.014
Chunjiong Zhang , Gaoyang Shan , Byeong-hee Roh
{"title":"Communication-efficient federated multi-domain learning for network anomaly detection","authors":"Chunjiong Zhang ,&nbsp;Gaoyang Shan ,&nbsp;Byeong-hee Roh","doi":"10.1016/j.dcan.2024.11.014","DOIUrl":null,"url":null,"abstract":"<div><div>Efficient and accurate anomaly detection in a network is of great significance for maintaining network and device security. Most anomaly detection methods assume that different anomalous network data distributions are the same or similar and ignore data privacy preservation. In this paper, a novel Federated Learning (FL) is proposed that it can quickly detect different types of anomalies in Non-Independent and Identically Distributed (Non-IID) data. First, we design a multi-domain machine learning model for multi-domain data, named Aegean, which consists of two modules: an ensemble AutoEncoder (AE) and a Generative Adversarial Network (GAN). Second, because data from different domains are non-IID, we model the anomaly detection problem as a dual problem, which can be recast as a robust optimization problem. The robust optimization problem is non-convex and therefore difficult to solve. As a remedy, we formulate and solve a dual problem by taking the Lagrangian dual function of the original problem. Experiments demonstrate that Aegean significantly outperforms the current state-of-the-art methods, with a 16% F1 score improvement over that of a One-Class Support Vector Machine (OCSVM). The designed FL significantly reduces the communication overhead of FedAvg without sacrificing anomaly detection performance.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"12 3","pages":"Pages 472-481"},"PeriodicalIF":6.3000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352864824001615","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/11/22 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Efficient and accurate anomaly detection in a network is of great significance for maintaining network and device security. Most anomaly detection methods assume that different anomalous network data distributions are the same or similar and ignore data privacy preservation. In this paper, a novel Federated Learning (FL) is proposed that it can quickly detect different types of anomalies in Non-Independent and Identically Distributed (Non-IID) data. First, we design a multi-domain machine learning model for multi-domain data, named Aegean, which consists of two modules: an ensemble AutoEncoder (AE) and a Generative Adversarial Network (GAN). Second, because data from different domains are non-IID, we model the anomaly detection problem as a dual problem, which can be recast as a robust optimization problem. The robust optimization problem is non-convex and therefore difficult to solve. As a remedy, we formulate and solve a dual problem by taking the Lagrangian dual function of the original problem. Experiments demonstrate that Aegean significantly outperforms the current state-of-the-art methods, with a 16% F1 score improvement over that of a One-Class Support Vector Machine (OCSVM). The designed FL significantly reduces the communication overhead of FedAvg without sacrificing anomaly detection performance.
面向网络异常检测的高效通信联邦多域学习
高效、准确的网络异常检测对于维护网络和设备的安全具有重要意义。大多数异常检测方法都假设不同的异常网络数据分布是相同或相似的,而忽略了数据隐私保护。本文提出了一种新的联邦学习(FL)方法,它可以快速检测非独立和同分布(Non-IID)数据中的不同类型的异常。首先,我们设计了一个多领域机器学习模型,命名为爱琴海,该模型由两个模块组成:集成自动编码器(AE)和生成对抗网络(GAN)。其次,由于来自不同领域的数据是非iid的,我们将异常检测问题建模为一个对偶问题,该对偶问题可以重新定义为一个鲁棒优化问题。鲁棒优化问题是非凸的,因此很难求解。作为补救,我们利用原问题的拉格朗日对偶函数来表述和求解一个对偶问题。实验表明,Aegean显著优于当前最先进的方法,比一类支持向量机(OCSVM)的F1分数提高了16%。所设计的FL在不牺牲异常检测性能的情况下显著降低了fedag的通信开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Digital Communications and Networks
Digital Communications and Networks Computer Science-Hardware and Architecture
CiteScore
12.80
自引率
5.10%
发文量
915
审稿时长
30 weeks
期刊介绍: Digital Communications and Networks is a prestigious journal that emphasizes on communication systems and networks. We publish only top-notch original articles and authoritative reviews, which undergo rigorous peer-review. We are proud to announce that all our articles are fully Open Access and can be accessed on ScienceDirect. Our journal is recognized and indexed by eminent databases such as the Science Citation Index Expanded (SCIE) and Scopus. In addition to regular articles, we may also consider exceptional conference papers that have been significantly expanded. Furthermore, we periodically release special issues that focus on specific aspects of the field. In conclusion, Digital Communications and Networks is a leading journal that guarantees exceptional quality and accessibility for researchers and scholars in the field of communication systems and networks.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书