Bilgisayar ve Bilişim Fakültesi Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.13091/10834

Browse

Now showing 1 - 6 of 6

Citation - WoS: 44
Citation - Scopus: 47
Binary Artificial Algae Algorithm for Feature Selection
(Elsevier, 2022) Türkoğlu, Bahaeddin; Uymaz, Sait Ali; Kaya, Ersin
In this study, binary versions of the Artificial Algae Algorithm (AAA) are presented and employed to determine the ideal attribute subset for classification processes. AAA is a recently proposed algorithm inspired by microalgae's living behavior, which has not been consistently implemented to determine ideal attribute subset (feature selection) processes yet. AAA can effectively look into the feature space for ideal attributes combination minimizing a designed objective function. The proposed binary versions of AAA are employed to determine the ideal attribute combination that maximizes classification success while minimizing the count of attributes. The original AAA is utilized in these versions while its continuous spaces are restricted in a threshold using an appropriate threshold function after flattening them. In order to demonstrate the performance of the presented binary artificial algae algorithm model, an experimental study was conducted with the latest seven highperformance optimization algorithms. Several evaluation metrics are used to accurately evaluate and analyze the performance of these algorithms over twenty-five datasets with different difficulty levels from the UCI Machine Learning Repository. The experimental results and statistical tests verify the performance of the presented algorithms in increasing the classification accuracy compared to other state-of-the-art binary algorithms, which confirms the capability of the AAA algorithm in exploring the attribute space and deciding the most valuable features for classification problems. (C) 2022 Elsevier B.V. All rights reserved.
Citation - WoS: 10
Citation - Scopus: 11
A Binary Sparrow Search Algorithm for Feature Selection on Classification of X-Ray Security Images
(Elsevier Ltd, 2024) Babalik, A.; Babadag, A.
In today's world, especially in public places, strict security measures are being implemented. Among these measures, the most common is the inspection of the contents of people's belongings, such as purses, knapsacks, and suitcases, through X-ray imaging to detect prohibited items. However, this process is typically performed manually by security personnel. It is an exhausting task that demands continuous attention and concentration, making it prone to errors. Additionally, the detection and classification of overlapping and occluded objects can be challenging. Therefore, automating this process can be highly beneficial for reducing errors and improving the overall efficiency. In this study, a framework consisting of three fundamental phases for the classification of prohibited objects was proposed. In the first phase, a deep neural network was trained using X-ray images to extract features. In the subsequent phase, features that best represent the object were selected. Feature selection helps eliminate redundant features, leading to the efficient use of memory, reduced computational costs, and improved classification accuracy owing to a decrease in the number of features. In the final phase, classification was performed using the selected features. In the first stage, a convolutional neural network model was utilized for feature extraction. In the second stage, the Sparrow Search Algorithm was binarized and proposed as the binISSA for feature selection. Feature selection was implemented using the proposed binISSA. In the final stage, classification was performed using the K-Nearest Neighbors (KNN) and Support Vector Machine (SVM) algorithms. The performances of the convolutional neural network and the proposed framework were compared. In addition, the performance of the proposed framework was compared with that of other state-of-the-art meta-heuristic algorithms. The proposed method increased the classification accuracy of the network from 0.9702 to 0.9763 using both the KNN and SVM (linear kernel) classifiers. The total number of features extracted using the deep neural network was 512. With the application of the proposed binISSA, average number of features were reduced to 25.33 using the KNN classifier and 32.70 using the SVM classifier. The results indicate a notable reduction in the extracted features from the convolutional neural network and an improvement in the classification accuracy. © 2024 Elsevier B.V.
Citation - WoS: 21
Citation - Scopus: 24
Boosting the Oversampling Methods Based on Differential Evolution Strategies for Imbalanced Learning
(Elsevier, 2021) Korkmaz, Sedat; Sahman, Mehmet Akif; Çınar, Ahmet Cevahir; Kaya, Ersin
The class imbalance problem is a challenging problem in the data mining area. To overcome the low classification performance related to imbalanced datasets, sampling strategies are used for balancing the datasets. Oversampling is a technique that increases the minority class samples in various proportions. In this work, these 16 different DE strategies are used for oversampling the imbalanced datasets for better classification. The main aim of this work is to determine the best strategy in terms of Area Under the receiver operating characteristic (ROC) Curve (AUC) and Geometric Mean (G-Mean) metrics. 44 imbalanced datasets are used in experiments. Support Vector Machines (SVM), k-Nearest Neighbor (kNN), and Decision Tree (DT) are used as a classifier in the experiments. The best results are produced by 6th Debohid Strategy (DSt6), 1th Debohid Strategy (DSt1), and 3th Debohid Strategy (DSt3) by using kNN, DT, and SVM classifiers, respectively. The obtained results outperform the 9 state-of-the-art oversampling methods in terms of AUC and G-Mean metrics (C) 2021 Elsevier B.V. All rights reserved.
Citation - WoS: 20
Citation - Scopus: 23
A Tree Seed Algorithm With Multi-Strategy for Parameter Estimation of Solar Photovoltaic Models
(Elsevier, 2024) Beskirli, Ayse; Dag, Idiris; Kiran, Mustafa Servet
Tree seed algorithm, which is one of the metaheuristics algorithms recently proposed for the solution of continuous optimization problems, has an effective algorithmic structure inspired by the relation between trees and seeds. At the same time, the use of two different solution generation mechanisms by depending on the control parameter in TSA aims to balance the exploration and exploitation capabilities of the algorithm. However, when the structure of the algorithm is examined in detail, it is seen that there are some disadvantages such as loss of population diversity and getting stuck in local minimums. To overcome these disadvantages in the basic algorithm, three different approaches (self-adaptive weighting mechanism, chaotic elite learning approach and experience-based learning method) were proposed to TSA under the name of multi-strategies in this study. The algorithm improved with these approaches is named as the multi-strategy-based tree seed algorithm (MS-TSA). MS-TSA was first tested on CEC2017 functions. Then MS-TSA was applied to the problems in the CEC2020 competition and compared with the results of the best performing algorithms in this competition. As a result of the comparisons, MS-TSA was found to be a competitive method on solving benchmark functions. Then, parameter estimation of single diode, double diode and photovoltaic module models using the input data of various solar panels was carried out by the MS-TSA. The results obtained with MS-TSA were compared with both the results of the basic TSA and the results of well-known algorithms in the literature. The results obtained are 9.8642E-04, 9.8356E-04, 2.4251E-03, 1.7534E-03 respectively. As a result of the comparative analysis, the lowest RMSE value was obtained by MS-TSA. In addition, comprehensive performance analyzes of the algorithms were made with the convergence curve, boxplots, current (I)- voltage (V) and power (P)- voltage (V) charac- teristic curves obtained according to the experimental results. As a result of the experiments and analyses, MS- TSA was found to be a more successful method than the compared algorithms in parameter estimation of PV models.
Citation - WoS: 1
Citation - Scopus: 1
Virtual Special Issue on Recent Advances in Discrete Swarm Intelligence Algorithms for Solving Engineering Problems
(Elsevier Ltd, 2022) Kıran, Mustafa Servet; Gao, Xiao-Zhi; Vasudevan, Muneeswaran; Gündüz, Mesut
[No abstract available]
Citation - WoS: 8
Citation - Scopus: 10
X-Ray Image Analysis for Explosive Circuit Detection Using Deep Learning Algorithms
(Elsevier Ltd, 2024) Seyfi, G.; Yilmaz, M.; Esme, E.; Kiran, M.S.
X-ray imaging technologies find applications across various domains, including medical imaging in health institutions or security in military facilities and public institutions. X-ray images acquired from diverse sources necessitate analysis by either trained human experts or automated systems. In cases where concealed electronic cards potentially pose threats, such as in laptops harboring explosive triggering circuits, conventional analysis methods are challenging to detect, even when scrutinized by skilled. The present investigation is centered on the utilization of deep learning algorithms for the analysis of X-ray images of laptop computers, with the aim of identifying concealed hazardous components. To construct the dataset, some control cards such as Arduino, Raspberry Pi and Bluetooth circuits were hidden inside the 60 distinct laptop computers and were subjected to X-ray imaging, yielding a total of 5094 X-ray images. The primary objective of this study is to distinguish laptops based on the presence or absence of concealed electronic cards. To this end, a suite of deep learning models, including EfficientNet, DenseNet, DarkNet19, DarkNet53, Inception, MobileNet, ResNet18, ResNet50, ResNet101, ShuffleNet and Xception were subjected to training, testing, and comparative evaluation. The performance of these models was assessed utilizing a range of metrics, encompassing accuracy, sensitivity, specificity, precision, f-measure, and g-mean. Among the various models examined, the ShuffleNet model emerged as the top-performing one, yielding superior results in terms of accuracy (0.8355), sensitivity (0.8199), specificity (0.8530), precision (0.8490), f-measure (0.8322), and g-mean (0.8352). © 2023 Elsevier B.V.

Browse

Browsing Bilgisayar ve Bilişim Fakültesi Koleksiyonu by Journal "Applied Soft Computing"