探讨基于流量统计的网络流分类中最优特征的选择

Ming Xu, Wenbo Zhu, Jian Xu, Ning Zheng
{"title":"探讨基于流量统计的网络流分类中最优特征的选择","authors":"Ming Xu, Wenbo Zhu, Jian Xu, Ning Zheng","doi":"10.1109/APNOMS.2015.7275371","DOIUrl":null,"url":null,"abstract":"The network traffic classification is one of the most fundamental work in the network measurement and management, and this problem is more and more impact as the network scale grows. Many methods are proposed by researchers, but methods based on flow statistics seem more popular than the others. In this paper, we proposed a novel method based on refined flow statistical features. The new statistics, skewness and kurtosis, and new flow statistical features, payload length, were introduced into raw feature set firstly. Then, with the consideration of efficiency in the classification stage, the feature selection was used on the raw feature set to get an optimal feature set and the feature selection are mainly based on the K-means clustering algorithm. The comparison experiment results show that the proposed optimal feature set reaches the same precision level with half time consuming and internal cluster distance when compared with the raw set.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Towards selecting optimal features for flow statistical based network traffic classification\",\"authors\":\"Ming Xu, Wenbo Zhu, Jian Xu, Ning Zheng\",\"doi\":\"10.1109/APNOMS.2015.7275371\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The network traffic classification is one of the most fundamental work in the network measurement and management, and this problem is more and more impact as the network scale grows. Many methods are proposed by researchers, but methods based on flow statistics seem more popular than the others. In this paper, we proposed a novel method based on refined flow statistical features. The new statistics, skewness and kurtosis, and new flow statistical features, payload length, were introduced into raw feature set firstly. Then, with the consideration of efficiency in the classification stage, the feature selection was used on the raw feature set to get an optimal feature set and the feature selection are mainly based on the K-means clustering algorithm. The comparison experiment results show that the proposed optimal feature set reaches the same precision level with half time consuming and internal cluster distance when compared with the raw set.\",\"PeriodicalId\":269263,\"journal\":{\"name\":\"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APNOMS.2015.7275371\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2015.7275371","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

网络流量分类是网络测量和管理中最基础的工作之一,随着网络规模的扩大,这一问题受到的影响越来越大。研究人员提出了许多方法,但基于流量统计的方法似乎比其他方法更受欢迎。本文提出了一种基于精细流量统计特征的新方法。首先在原始特征集中引入了新的统计特征偏度和峰度,以及新的流量统计特征载荷长度。然后,考虑到分类阶段的效率,对原始特征集进行特征选择,得到最优特征集,特征选择主要基于k均值聚类算法。对比实验结果表明,本文提出的最优特征集与原始特征集相比,以一半的时间和内部聚类距离达到了相同的精度水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards selecting optimal features for flow statistical based network traffic classification
The network traffic classification is one of the most fundamental work in the network measurement and management, and this problem is more and more impact as the network scale grows. Many methods are proposed by researchers, but methods based on flow statistics seem more popular than the others. In this paper, we proposed a novel method based on refined flow statistical features. The new statistics, skewness and kurtosis, and new flow statistical features, payload length, were introduced into raw feature set firstly. Then, with the consideration of efficiency in the classification stage, the feature selection was used on the raw feature set to get an optimal feature set and the feature selection are mainly based on the K-means clustering algorithm. The comparison experiment results show that the proposed optimal feature set reaches the same precision level with half time consuming and internal cluster distance when compared with the raw set.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信