Towards a Profiling View for Unsupervised Traffic Classification by Exploring the Statistic Features and Link Patterns

Meng Qin, Kai Lei, B. Bai, Gong Zhang
{"title":"Towards a Profiling View for Unsupervised Traffic Classification by Exploring the Statistic Features and Link Patterns","authors":"Meng Qin, Kai Lei, B. Bai, Gong Zhang","doi":"10.1145/3341216.3342213","DOIUrl":null,"url":null,"abstract":"In this paper, we study the network traffic classification task. Different from existing supervised methods that rely heavily on the labeled statistic features in a long period (e.g., several hours or days), we adopt a novel view of unsupervised profiling to explore the flow features and link patterns in a short time window (e.g., several seconds), dealing with the zero-day traffic problem. Concretely, we formulate the traffic identification task as a graph co-clustering problem with topology and edge attributes, and proposed a novel Hybrid Flow Clustering (HFC) model. The model can potentially achieve high classification performance, since it comprehensively leverages the available information of both features and linkage. Moreover, the two information sources integrated in HFC can also be utilized to generate the profiling for each flow category, helping to reveal the deep knowledge and semantics of network traffic. The effectiveness of the model is verified in the extensive experiments on several real datasets of various scenarios, where HFC achieves impressive results and presents powerful application ability.","PeriodicalId":407013,"journal":{"name":"Proceedings of the 2019 Workshop on Network Meets AI & ML","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 Workshop on Network Meets AI & ML","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3341216.3342213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

In this paper, we study the network traffic classification task. Different from existing supervised methods that rely heavily on the labeled statistic features in a long period (e.g., several hours or days), we adopt a novel view of unsupervised profiling to explore the flow features and link patterns in a short time window (e.g., several seconds), dealing with the zero-day traffic problem. Concretely, we formulate the traffic identification task as a graph co-clustering problem with topology and edge attributes, and proposed a novel Hybrid Flow Clustering (HFC) model. The model can potentially achieve high classification performance, since it comprehensively leverages the available information of both features and linkage. Moreover, the two information sources integrated in HFC can also be utilized to generate the profiling for each flow category, helping to reveal the deep knowledge and semantics of network traffic. The effectiveness of the model is verified in the extensive experiments on several real datasets of various scenarios, where HFC achieves impressive results and presents powerful application ability.
从统计特征和链路模式探索无监督流量分类的分析视图
本文主要研究网络流量分类任务。与现有的严重依赖于长时间(例如,几个小时或几天)标记统计特征的监督方法不同,我们采用了一种新的无监督分析观点来探索短时间窗口(例如,几秒钟)的流量特征和链接模式,处理零日流量问题。具体而言,我们将流量识别任务表述为具有拓扑和边缘属性的图共聚问题,并提出了一种新的混合流聚类(HFC)模型。该模型综合利用了特征和链接的可用信息,具有很高的分类性能。此外,HFC中集成的两个信息源还可以用于生成每个流类别的分析,有助于揭示网络流量的深度知识和语义。在不同场景的多个真实数据集上进行了大量实验,验证了模型的有效性,HFC取得了令人印象深刻的效果,展现出强大的应用能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信