Detection of Cyberattack in Network Using Machine Learning

S. Naik, Mohammad Arshad
{"title":"Detection of Cyberattack in Network Using Machine Learning","authors":"S. Naik, Mohammad Arshad","doi":"10.1109/ASSIC55218.2022.10088380","DOIUrl":null,"url":null,"abstract":"Malicious Web attacks hide behind normal data in irregular organization traffic. It causes internet frustration and obscurity, making it difficult for the Organization Access Framework to maintain identification accuracy and timing. This research examines machine learning and deep reading for unequal network traffic. First, utilise ENN to divide incomparable training sets into solid and simple sets. Next, use KMeans to compress a fancy set's samples to reduce degree. Focus and delete little samples from a nice set, then mix fresh samples to increase the minimal number. A simple set, a compressed set of heavy objects, and several hard sets were merged to produce a new training set. The technique lowers initial training set inconsistencies and improves data for younger students. It helps class dividers learn differences during training and improves design effectiveness. For testing, we used the old NSL-KDD website. We employ random field (RF) and VSM classification models (SVM). Our proposed DSSTE algorithm performs worse than 24 other techniques.","PeriodicalId":441406,"journal":{"name":"2022 International Conference on Advancements in Smart, Secure and Intelligent Computing (ASSIC)","volume":"3 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Advancements in Smart, Secure and Intelligent Computing (ASSIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASSIC55218.2022.10088380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Malicious Web attacks hide behind normal data in irregular organization traffic. It causes internet frustration and obscurity, making it difficult for the Organization Access Framework to maintain identification accuracy and timing. This research examines machine learning and deep reading for unequal network traffic. First, utilise ENN to divide incomparable training sets into solid and simple sets. Next, use KMeans to compress a fancy set's samples to reduce degree. Focus and delete little samples from a nice set, then mix fresh samples to increase the minimal number. A simple set, a compressed set of heavy objects, and several hard sets were merged to produce a new training set. The technique lowers initial training set inconsistencies and improves data for younger students. It helps class dividers learn differences during training and improves design effectiveness. For testing, we used the old NSL-KDD website. We employ random field (RF) and VSM classification models (SVM). Our proposed DSSTE algorithm performs worse than 24 other techniques.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于机器学习的网络攻击检测
恶意Web攻击隐藏在不规则组织流量的正常数据背后。它会导致互联网的挫折和模糊,使组织访问框架难以保持识别的准确性和时效性。本研究考察了机器学习和深度阅读对不均等网络流量的影响。首先,利用新神经网络将不可比拟的训练集划分为实体集和简单集。接下来,使用KMeans压缩花式集合的样本以降低度。集中和删除小样本从一个好的集合,然后混合新鲜的样本,以增加最小的数量。将一个简单集、一个压缩的重物集和几个硬集合并成一个新的训练集。该技术降低了初始训练集的不一致性,并改善了年轻学生的数据。它帮助班级划分者在培训中了解差异,提高设计效率。为了进行测试,我们使用了旧的NSL-KDD网站。我们采用随机场(RF)和VSM分类模型(SVM)。我们提出的DSSTE算法比其他24种技术性能差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Technological Empowerment: Applications of Machine Learning in Oral Healthcare Emotion Recognition From Online Classroom Videos Using Meta Learning Design and Development Recommendations for a Smart Weather Monitoring System Modified Convolutional Neural Network for Fashion Classification Challenges of Medical Text and Image Processing
×
引用
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