Efficient Intrusion Detection based on Kulczynski Similarity Measurement

In this study, to facilitate the identification of hazardous software and attempts to compromise it, it is recommended that a modified version of the Kukeyzy similarity measure be utilized with the assistance of cybersecurity experts. This suggestion is based on the findings of this study. Block-wise similarity partitioning was created with the primary purpose of achieving a high degree of detection accuracy while also reducing the number of false alarms sent out. The goal of creating this plan was to make this potential a reality. We used both the UNSW-NB15 benchmark dataset and the NSL-KDD dataset. We can access both of these datasets. We demonstrated that our model outperforms traditional methods using well-established criteria, including accuracy, precision, recall, and F1 score. These criteria were used to do this. As a result, we successfully executed what we set out to do. The model performed exceptionally well, particularly in accurately predicting 98.47% of the data associated with the UNSW-NB15 and 93.18% of the data linked to the NSL-KDD. This indicates that the model performed well. Both of these numbers show that the product is of good quality overall. The method is straightforward to understand and works effectively, which makes it a good choice for cybersecurity applications.

Authors

Institutions

Publication Details

Journal
International Journal on Advanced Science Engineering and Information Technology
Published
2025-08-27
DOI
https://doi.org/10.18517/ijaseit.15.4.13551
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Intrusion Detection based on Kulczynski Similarity Measurement

Dhiah Al‐Shammary, Ali Jaber Tayh Albderi
International Journal on Advanced Science Engineering and Information Technology
Network Security and Intrusion Detection
article

Efficient Intrusion Detection based on Kulczynski Similarity Measurement

Dhiah Al‐Shammary, Ali Jaber Tayh Albderi
article en

Abstract

In this study, to facilitate the identification of hazardous software and attempts to compromise it, it is recommended that a modified version of the Kukeyzy similarity measure be utilized with the assistance of cybersecurity experts. This suggestion is based on the findings of this study. Block-wise similarity partitioning was created with the primary purpose of achieving a high degree of detection accuracy while also reducing the number of false alarms sent out. The goal of creating this plan was to make this potential a reality. We used both the UNSW-NB15 benchmark dataset and the NSL-KDD dataset. We can access both of these datasets. We demonstrated that our model outperforms traditional methods using well-established criteria, including accuracy, precision, recall, and F1 score. These criteria were used to do this. As a result, we successfully executed what we set out to do. The model performed exceptionally well, particularly in accurately predicting 98.47% of the data associated with the UNSW-NB15 and 93.18% of the data linked to the NSL-KDD. This indicates that the model performed well. Both of these numbers show that the product is of good quality overall. The method is straightforward to understand and works effectively, which makes it a good choice for cybersecurity applications.

International Journal on Advanced Science Engineering and Information TechnologyVol. 15(4)
University of Al-Qadisiyah (IQ)
Openalex Percentile: Top 73%
Network Security and Intrusion Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.