Evolving Cauchy possibilistic clustering based on cosine similarity for monitoring cyber systems

I. Škrjanc, A. Sanchis, J. A. Iglesias, Agapito Ledezma, D. Dovžan
{"title":"Evolving Cauchy possibilistic clustering based on cosine similarity for monitoring cyber systems","authors":"I. Škrjanc, A. Sanchis, J. A. Iglesias, Agapito Ledezma, D. Dovžan","doi":"10.1109/EAIS.2017.7954825","DOIUrl":null,"url":null,"abstract":"In this paper the idea of evolving Cauchy clustering based on cosine similarity is given. It is used for monitoring in the case of cyber attacks. The proposed idea is for that kind of processes very interesting because it is very efficient when the data are noisy and when the outliers appear frequently and this is the case when dealing with cyber attacks data. The algorithm is given in an evolving form to be able to deal with big-data sets. One of the important features of the described clustering algorithm is that it deals with just few tuning parameters, such as maximal density. In this paper, the proposed approach was realized on DARPA data base and promising results have been achieved.","PeriodicalId":286312,"journal":{"name":"2017 Evolving and Adaptive Intelligent Systems (EAIS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Evolving and Adaptive Intelligent Systems (EAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EAIS.2017.7954825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper the idea of evolving Cauchy clustering based on cosine similarity is given. It is used for monitoring in the case of cyber attacks. The proposed idea is for that kind of processes very interesting because it is very efficient when the data are noisy and when the outliers appear frequently and this is the case when dealing with cyber attacks data. The algorithm is given in an evolving form to be able to deal with big-data sets. One of the important features of the described clustering algorithm is that it deals with just few tuning parameters, such as maximal density. In this paper, the proposed approach was realized on DARPA data base and promising results have been achieved.
基于余弦相似度的监测网络系统演化柯西可能聚类
本文给出了基于余弦相似度的柯西聚类进化思想。它用于监控网络攻击的情况。我们提出的想法对于这种过程来说非常有趣因为当数据有噪声时,当异常值频繁出现时,它是非常有效的,这就是处理网络攻击数据的情况。该算法以一种进化的形式给出,以便能够处理大数据集。所描述的聚类算法的一个重要特征是它只处理很少的调优参数,例如最大密度。本文在DARPA数据库上实现了该方法,并取得了良好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信