检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:崔梦阳 董育宁[1] 邱晓晖[1] 田炜[1] CUI Mengyang;DONG Yuning;QUI Xiaohui;TIAN Wei(School of Communications and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)
机构地区:[1]南京邮电大学通信与信息工程学院,江苏南京210003
出 处:《软件工程》2024年第10期23-28,共6页Software Engineering
摘 要:面对网络流量新类别不断涌现的挑战,以及随之而来的开集识别和模型更新需求,文章提出了一种基于增量学习的开集网络流量分类方法。对于开集识别,支持向量机和K均值聚类算法的级联结构可以持续识别新类和已知类;对于模型更新,基于候选支持向量筛选的“样本回放”和新旧模型加权融合的“参数回放”方法,能有效解决“有类增量的灾难性遗忘”问题。与ISK和DACS方法相比,该方法应用在开集流量识别和分类任务中表现出显著优势,F1分数能提高1百分点至8百分点,分类速度也优于现有方法。Facing the challenge of emerging new categories of network traffic and the resulting needs for open set recognition and model updates,this paper proposes an incremental learning-based method for open set network traffic classification.For open set recognition,a cascade structure of support vector machines and K-means clustering algorithms is employed to continuously identify new and known classes.For model updates,the"sample replay"method based on candidate support vector selection and the"parameter replay"approach of weighted fusion of old and new models effectively address the issue of"catastrophic forgetting in class incremental learning".Compared to the ISK and DACS methods,this approach demonstrates significant advantages in open set traffic recognition and classification tasks,with an F1 score improvement of 1 to 8 percentage points,and a classification speed superior to existing methods.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33