Dynamic Evolving Cauchy Possibilistic Clustering Based on the Self-Similarity Principle (DECS) for Enhancing Intrusion Detection System

Abstract

Unsupervised machine learning plays a critical role in improving the security level of applications and systems. The cyberattack floods the network with data streams to deny services or destroy the network infrastructure. In this paper, a new development strategy (dynamic evolving cauchy possibilistic clustering based on the self-similarity principle (DECS)) is proposed to optimize the data stream clustering model based on the self-similarity principles (inter-cluster and intra-cluster). It is based on computing the self-similarity principles for data between and within clusters. The proposed system mitigates the dependence on the centre of the cluster to produce clusters with highly correlated data and minimal errors within the same cluster. The DECS consists of two phases: In the first phase, the data are clustered based on density points to generate clusters, and in the second phase, the clusters are evolved according to the inter-and intra-distance points to/in the clusters. The proposed model is tested on well-known intrusion datasets such as UNSW-NB15, KDD99 and NSL-KDD. In the experiments, DECS efficiently clustered the data with fewer errors and an optimal number of clusters compared to other models, it has achieved minimum error, high silhouette coefficient and an optimal number of clusters. The implementation results show that the average error of DECS over eight datasets is (0.45) with an average silhouette coefficient (0.63). At the same time, the pure cauchy possibilistic clustering obtains on average error (0.69) and silhouette coefficient (0.44).

Enhanced PSO Algorithm for Detecting DRDoS Attacks on LDAP Servers

“…Feature selection is the most important and best strategy that exists to reduce data dimensions and has been used for numerous real-world problems. In the scenario of a dataset that may contain noisy, irrelevant, or redundant attributes [15,16], it often slows down and even degrades the accuracy of a learning system [17]. A feature selection algorithm plays a crucial role in minimizing the number of attributes, reducing learning time, and improving the classification performance of algorithms by eliminating unnecessary and redundant features.…”

“…Therefore, hackers employ several tools or programs to generate a flood of malicious traffic and launch attacks against the International Journal of Intelligent Engineering and Systems, Vol. 16, No. 5,2023 DOI: 10.22266/ijies2023.1031.61…”

Data Collected and Analysis of COVID-19 Infection Status: Case Study of Iraqi Hospital Patients in Diwaniyah and Najaf Governorates

“…Each internal node represents a feature of the data. The algorithm works by dividing the primary node into smaller nodes to provide prediction according to specific entries, which works with categorical and numerical data [28].…”

Dynamic Clustering Strategies Boosting Deep Learning in Olive Leaf Disease Diagnosis

“…Cluster the training data using dynamic evolving Cauchy possibilistic clustering, which operates according to the self-similarity principle (DECS). This approach groups similar olive leaf images, creating distinct clusters that effectively capture the inherent patterns and relationships within the dataset [38]. This clustering approach allows the deep learning model to better recognize and learn from the different features of the olive leaf samples, improving its ability to classify different disease types accurately.…”

“…This clustering approach allows the deep learning model to better recognize and learn from the different features of the olive leaf samples, improving its ability to classify different disease types accurately. According to [38], this step has two activities: generate the initial clustering pool and optimize the existing one.…”