当前位置: X-MOL 学术Comput. Secur. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Unsupervised feature selection and cluster center initialization based arbitrary shaped clusters for intrusion detection
Computers & Security ( IF 4.8 ) Pub Date : 2020-12-01 , DOI: 10.1016/j.cose.2020.102062
Mahendra Prasad , Sachin Tripathi , Keshav Dahal

Abstract The massive growth of data in the network leads to attacks or intrusions. An intrusion detection system detects intrusions from high volume datasets but increases complexities. A network generates a large number of unlabeled data that is free from labeling costs. Unsupervised feature selection handles these data and reduces computational complexities. In this paper, we have proposed a clustering method based on unsupervised feature selection and cluster center initialization for intrusion detection. This method computes initial centers using sets of semi-identical instances, which indicate dense data space and avoid outliers as initial cluster centers. A spatial distance between data points and cluster centers create micro-clusters. Similar micro-clusters merge into a cluster that is an arbitrary shape. The proposed cluster center initialization based clustering method performs better than basic clustering, which takes fewer iterations to form final clusters and provides better accuracy. We simulated a wormhole attack and generated the Wormhole dataset in the mobile ad-hoc network in NS-3. Micro-clustering methods have executed on different network datasets (KDD, CICIDS2017, and Wormhole dataset), which outperformed for new attacks or those contain few samples. Experimental results confirm that the proposed method is suitable for LAN and mobile ad-hoc network, varying data density, and large datasets.

中文翻译:

基于任意形状簇的无监督特征选择和簇中心初始化用于入侵检测

摘要 网络中数据的大量增长导致攻击或入侵。入侵检测系统检测来自大量数据集的入侵,但增加了复杂性。一个网络会产生大量的无标签数据,这些数据没有标签成本。无监督特征选择处理这些数据并降低计算复杂性。在本文中,我们提出了一种基于无监督特征选择和聚类中心初始化的入侵检测聚类方法。此方法使用半相同实例集计算初始中心,这些实例指示密集数据空间并避免将异常值作为初始聚类中心。数据点和集群中心之间的空间距离创建了微集群。相似的微簇合并成一个任意形状的簇。所提出的基于聚类中心初始化的聚类方法比基本聚类方法表现更好,它需要更少的迭代来形成最终聚类并提供更好的准确性。我们模拟了虫洞攻击并在 NS-3 的移动自组织网络中生成了虫洞数据集。微聚类方法已在不同的网络数据集(KDD、CICIDS2017 和虫洞数据集)上执行,这些方法在新攻击或包含很少样本的攻击中表现出色。实验结果证实,所提出的方法适用于局域网和移动自组织网络、变化的数据密度和大数据集。我们模拟了虫洞攻击并在 NS-3 的移动自组织网络中生成了虫洞数据集。微聚类方法已在不同的网络数据集(KDD、CICIDS2017 和虫洞数据集)上执行,这些方法在新攻击或包含很少样本的攻击中表现出色。实验结果证实,所提出的方法适用于局域网和移动自组织网络、变化的数据密度和大数据集。我们模拟了虫洞攻击并在 NS-3 的移动自组织网络中生成了虫洞数据集。微聚类方法已在不同的网络数据集(KDD、CICIDS2017 和虫洞数据集)上执行,这些方法在新攻击或包含很少样本的攻击中表现出色。实验结果证实,所提出的方法适用于局域网和移动自组织网络、变化的数据密度和大数据集。
更新日期:2020-12-01
down
wechat
bug