利用K-Means算法分析数据通信网络产生的大数据,了解传入恶意连接的性质

L. B. Shyamasundar, V. A. Kumar, Jhansi Rani Prathuri
{"title":"利用K-Means算法分析数据通信网络产生的大数据,了解传入恶意连接的性质","authors":"L. B. Shyamasundar, V. A. Kumar, Jhansi Rani Prathuri","doi":"10.1109/MPCIT51588.2020.9350510","DOIUrl":null,"url":null,"abstract":"An environment is developed with a distributed Apache SPARK, deployed on Hadoop cluster for timely inference and classification of security incidents. Analysis of 85GB of network-packet dataset collected over four months is done (provided by CSIR-4PI, Govt. of India). K-means machine learning algorithm is used to analyze the network traffic based on various fields. By building and evaluating models, optimum number of clusters was determined. Clustering results are evaluated by calculating the clustering score using Within-Set Sum-of-Squared-Errors(WSSSE), entropy, Silhotte, Davies-Bouldin-Index and Dunn-Index. Several plots are visualized to understand the clustering analysis results and understand the nature of incoming malicious connections.","PeriodicalId":136514,"journal":{"name":"2020 Third International Conference on Multimedia Processing, Communication & Information Technology (MPCIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analyzing Big Data Originated from Data Communication Networks using K-Means Algorithm to Understand the Nature of Incoming Malicious Connections\",\"authors\":\"L. B. Shyamasundar, V. A. Kumar, Jhansi Rani Prathuri\",\"doi\":\"10.1109/MPCIT51588.2020.9350510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An environment is developed with a distributed Apache SPARK, deployed on Hadoop cluster for timely inference and classification of security incidents. Analysis of 85GB of network-packet dataset collected over four months is done (provided by CSIR-4PI, Govt. of India). K-means machine learning algorithm is used to analyze the network traffic based on various fields. By building and evaluating models, optimum number of clusters was determined. Clustering results are evaluated by calculating the clustering score using Within-Set Sum-of-Squared-Errors(WSSSE), entropy, Silhotte, Davies-Bouldin-Index and Dunn-Index. Several plots are visualized to understand the clustering analysis results and understand the nature of incoming malicious connections.\",\"PeriodicalId\":136514,\"journal\":{\"name\":\"2020 Third International Conference on Multimedia Processing, Communication & Information Technology (MPCIT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Third International Conference on Multimedia Processing, Communication & Information Technology (MPCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MPCIT51588.2020.9350510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Third International Conference on Multimedia Processing, Communication & Information Technology (MPCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MPCIT51588.2020.9350510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

使用分布式Apache SPARK开发环境,部署在Hadoop集群上,对安全事件进行及时推断和分类。对四个月收集的85GB网络数据包数据集进行了分析(由印度政府的CSIR-4PI提供)。使用K-means机器学习算法对基于各个领域的网络流量进行分析。通过模型的建立和评价,确定了最优聚类数量。通过使用集内误差平方和(WSSSE)、熵、Silhotte、Davies-Bouldin-Index和Dunn-Index计算聚类得分来评估聚类结果。为了理解聚类分析结果和了解传入的恶意连接的性质,可视化了几个图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Analyzing Big Data Originated from Data Communication Networks using K-Means Algorithm to Understand the Nature of Incoming Malicious Connections
An environment is developed with a distributed Apache SPARK, deployed on Hadoop cluster for timely inference and classification of security incidents. Analysis of 85GB of network-packet dataset collected over four months is done (provided by CSIR-4PI, Govt. of India). K-means machine learning algorithm is used to analyze the network traffic based on various fields. By building and evaluating models, optimum number of clusters was determined. Clustering results are evaluated by calculating the clustering score using Within-Set Sum-of-Squared-Errors(WSSSE), entropy, Silhotte, Davies-Bouldin-Index and Dunn-Index. Several plots are visualized to understand the clustering analysis results and understand the nature of incoming malicious connections.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Smart Parking System (S-Park) – A Novel Application to Provide Real-Time Parking Solution PZM and DoG based Feature Extraction Technique for Facial Recognition among Monozygotic Twins A Novel Model of Supervised Clustering using Sentiment and Contextual Analysis for Fake News Detection MPCIT 2020 Full Papers Design and Implementation of Automated Image Handwriting Sentences Recognition using Hybrid Techniques on FPGA
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1