Hardi Sabah Talabani

Mr. Hardi Sabah Talabani

Charmo University, Sulaymaniyah, Iraq
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2022 in Science Journal of University of Zakho
Verified
Journal Article
Open access
PDF file
Hardi Sabah TalabaniHardi Sabah Talabani
Hardi Sabah Talabani
HAHezha M.TAreq Abdulhadi
Hezha M.TAreq Abdulhadi
Cryptocurrencies have completely altered the digital transaction process all over the globe. Almost a decade after Satoshi Nakamoto generated the first Bitcoin block; many cryptocurrencies have been established. The Ransomware attack is a type of cybercrime and a class of malware that encrypts the files and prevents users from accessing their data or systems and demands payment for decrypting and retrieving access to their files. Ransomware data classification using present data mining and machine learning methods is difficult because predictions aren't always correct. We aim to build two models that effectively address these challenges and can diagnose and classify Ransomware attacks accurately, then compare the performance of the models. In this paper, we investigated the use of Rule-Based algorithms for mining Bitcoin Ransomware Data to classify Ransomware attacks in Bitcoin transactions. Employing Rule-Based techniques in detecting Bitcoin data is beneficial because the algorithms effectively classify non-linear datasets. The analysis was done on a Bitcoin dataset for 61,004 addresses selected from 29 Ransomware families and contained ten descriptive and decision attributes. Both Rule-Based algorithms were illustrated and compared on the dataset employing 10-fold cross-validation. Experimental results show that classification under partial decision tree (PART) algorithm performed better in different metrics than the Decision Table algorithm. It provides an accuracy of 96.01%, a recall of 96%, a precision of 95.9%, and an F-Measure of 95.6%. Experimental results propose that it is beneficial to further investigate the application of PART to predictive modelling tasks in Ransomware studies.

1 September 2018
Verified
Conference Paper
Closed access
Hardi Sabah TalabaniHardi Sabah Talabani
Hardi Sabah Talabani
EAEngin Avci
Engin Avci
In this work, a database was used under the name “Autistic Spectrum Disorder Screening Data for Children Data Set” which was acquired from the data warehouse (UCI database repository). This dataset contains information for 292 children with 21 attributes. Using Weka tool. Mentioned data were classified by whether is diagnosed with autism disease or not. Using four types of support vector machine kernels. Normalized polynomial kernel, polynomial kernel, PUK kernel and RBF kernel classifiers utilized in data mining. The values which were used for performance comparisons are accuracy, precision, sensitivity, F measure and confusion matrix for each kernel. In this study, 100% successful results of accuracy have been obtained with each of polynomial kernel and PUK kernel.

3 January 2023 in Computers
Verified
Journal Article
Open access
PDF file
Dler Osman HasanDler Osman Hasan
Dler Osman Hasan
Aso Mohammed AladdinAso Mohammed Aladdin
Aso Mohammed Aladdin
Hardi Sabah TalabaniHardi Sabah Talabani
Hardi Sabah Talabani
Tarik RashidTarik Rashid
Tarik Rashid
Seyedali MirjaliliSeyedali Mirjalili
Seyedali Mirjalili
The Fifteen Puzzle problem is one of the most classical problems that has captivated mathematics enthusiasts for centuries. This is mainly because of the huge size of the state space with approximately 1013 states that have to be explored, and several algorithms have been applied to solve the Fifteen Puzzle instances. In this paper, to manage this large state space, the bidirectional A* (BA*) search algorithm with three heuristics, such as Manhattan distance (MD), linear conflict (LC), and walking distance (WD), has been used to solve the Fifteen Puzzle problem. The three mentioned heuristics will be hybridized in a way that can dramatically reduce the number of states generated by the algorithm. Moreover, all these heuristics require only 25 KB of storage, but help the algorithm effectively reduce the number of generated states and expand fewer nodes. Our implementation of the BA* search can significantly reduce the space complexity, and guarantee either optimal or near-optimal solutions.

7 May 2025 in Future Internet
Verified
Journal Article
Open access
PDF file
Hardi Sabah TalabaniHardi Sabah Talabani
Hardi Sabah Talabani
ZAZrar Abdul
Zrar Abdul
HMHardi Mohammed
Hardi Mohammed
DNS over HTTPS (DoH) is an advanced version of the traditional DNS protocol that prevents eavesdropping and man-in-the-middle attacks by encrypting queries and responses. However, it introduces new challenges such as encrypted traffic communication, masking malicious activity, tunneling attacks, and complicating intrusion detection system (IDS) packet inspection. In contrast, unencrypted packets in the traditional Non-DoH version remain vulnerable to eavesdropping, privacy breaches, and spoofing. To address these challenges, an optimized dual-path feature selection approach is designed to select the most efficient packet features for binary class (DoH-Normal, DoH-Malicious) and multiclass (Non-DoH, DoH-Normal, DoH-Malicious) classification. Ant Colony Optimization (ACO) is integrated with machine learning algorithms such as XGBoost, K-Nearest Neighbors (KNN), Random Forest (RF), and Convolutional Neural Networks (CNNs) using CIRA-CIC-DoHBrw-2020 as the benchmark dataset. Experimental results show that the proposed model selects the most effective features for both scenarios, achieving the highest detection and outperforming previous studies in IDS. The highest accuracy obtained for binary and multiclass classifications was 0.9999 and 0.9955, respectively. The optimized feature set contributed significantly to reducing computational costs and processing time across all utilized classifiers. The results provide a robust, fast, and accurate solution to challenges associated with encrypted DNS packets.

1 July 2021 in UHD Journal of Science and Technology
Verified
Journal Article
Open access
PDF file
HAHezha M.TAreq Abdulhadi
Hezha M.TAreq Abdulhadi
Hardi Sabah TalabaniHardi Sabah Talabani
Hardi Sabah Talabani
Thoracic surgery refers to the information gathered for the patients who have to suffer from lung cancer. Various machine learning techniques were employed in post-operative life expectancy to predict lung cancer patients. In this study, we have used the most famous and influential supervised machine learning algorithms, which are J48, Naïve Bayes, Multilayer Perceptron, and Random Forest (RF). Then, two ranker feature selections, information gain and gain ratio, were used on the thoracic surgery dataset to examine and explore the effect of used ranker feature selections on the machine learning classifiers. The dataset was collected from the Wroclaw University in UCI repository website. We have done two experiments to show the performances of the supervised classifiers on the dataset with and without employing the ranker feature selection. The obtained results with the ranker feature selections showed that J48, NB, and MLP’s accuracy improved, whereas RF accuracy decreased and support vector machine remained stable.

1 September 2018
Verified
Conference Paper
Closed access
Hardi Sabah TalabaniHardi Sabah Talabani
Hardi Sabah Talabani
EAEngin Avci
Engin Avci
This study displays the impacts of different types of Kernel functions for improving the learning capacity of Support Vector Machine (SVM) in treating two common types of warts (plantar and common warts). The impacts of four Kernel functions of (SVM): Normalized Polynomial Kernel (NP), Polynomial Kernel (PK), Radial Basis Function Kernel (RBF), and Pearson VII function based Universal Kernel (PUK) have been examined On two sets of data called “Cryotherapy” and “Immunotherapy”. Which are universally regarded as the best two methods to treat wart disease using Weka workbench. The first dataset called “Cryotherapy” consists of information about 90 patients and contains 7 features. The second dataset called “Immunotherapy” consists of information about 90 patients and contains 8 features. For presenting classification performance impacts each of Accuracy, precision, sensitivity, F-measure and confusion matrix for each kernel has been utilized. According to the results obtained, it was found that each of PUK and RBF performs best classification performance on “Cryotherapy” dataset with 97.77% accuracy whereas each of PK and PUK performs best classification performance on “Immunotherapy” dataset with 81.11% accuracy.