Yazılım Mühendisliği Bölümü

Permanent URI for this communityhttps://hdl.handle.net/20.500.12416/2146

Browse

Now showing 1 - 6 of 6

Citation - WoS: 186
Citation - Scopus: 245
A comprehensive survey on recent metaheuristics for feature selection
(Elsevier, 2022) Dokeroglu, Tansel; Deniz, Ayca; Kiziloz, Hakan Ezgi; 234173; Yazılım Mühendisliği
Feature selection has become an indispensable machine learning process for data preprocessing due to the ever-increasing sizes in actual data. There have been many solution methods proposed for feature selection since the 1970s. For the last two decades, we have witnessed the superiority of metaheuristic feature selection algorithms, and tens of new ones are being proposed every year. This survey focuses on the most outstanding recent metaheuristic feature selection algorithms of the last two decades in terms of their performance in exploration/exploitation operators, selection methods, transfer functions, fitness value evaluations, and parameter setting techniques. Current challenges of the metaheuristic feature selection algorithms and possible future research topics are examined and brought to the attention of the researchers as well.
Citation - WoS: 3
Citation - Scopus: 4
A new robust Harris Hawk optimization algorithm for large quadratic assignment problems
(Springer London Ltd, 2023) Dokeroglu, Tansel; Ozdemir, Yavuz Selim; 234173; Yazılım Mühendisliği
Harris Hawk optimization (HHO) is a new robust metaheuristic algorithm proposed for the solution of large intractable combinatorial optimization problems. The hawks are cooperative birds and use many intelligent hunting techniques. This study proposes new HHO algorithms for solving the well-known quadratic assignment problem (QAP). Large instances of the QAP have not been solved exactly yet. We implement HHO algorithms with robust tabu search (HHO-RTS) and introduce new operators that simulate the actions of hawks. We also developed an island parallel version of the HHO-RTS algorithm using the message passing interface. We verify the performance of our proposed algorithms on the QAPLIB benchmark library. One hundred and twenty-five of 135 problems are solved optimally, and the average deviation of all the problems is observed to be 0.020%. The HHO-RTS algorithm is a robust algorithm compared to recent studies in the literature.
Citation - WoS: 6
Citation - Scopus: 7
An island parallel Harris hawks optimization algorithm
(Springer London Ltd, 2022) Dokeroglu, Tansel; Sevinc, Ender; 234173; Yazılım Mühendisliği
The Harris hawk optimization (HHO) is an impressive optimization algorithm that makes use of unique mathematical approaches. This study proposes an island parallel HHO (IP-HHO) version of the algorithm for optimizing continuous multi-dimensional problems for the first time in the literature. To evaluate the performance of the IP-HHO, thirteen unimodal and multimodal benchmark problems with different dimensions (30, 100, 500, and 1000) are evaluated. The implementation of this novel algorithm took into account the investigation, exploitation, and avoidance of local optima issues effectively. Parallel computation provides a multi-swarm environment for thousands of hawks simultaneously. On all issue cases, we were able to enhance the performance of the sequential version of the HHO algorithm. As the number of processors increases, the suggested IP-HHO method enhances its performance while retaining scalability and improving its computation speed. The IP-HHO method outperforms the other state-of-the-art metaheuristic algorithms on average as the size of the dimensions grows.
Citation - WoS: 20
Citation - Scopus: 29
Creating consensus group using online learning based reputation in blockchain networks
(Elsevier, 2019) Bugday, Ahmet; Ozsoy, Adnan; Oztaner, Serdar Murat; Sever, Hayri; 11916; Bilgisayar Mühendisliği
One of the biggest challenges to blockchain technology is the scalability problem. The choice of consensus algorithm is critical to the practical solution of the scalability problem. To increase scalability, Byzantine Fault Tolerance (BFT) based methods have been most widely applied. This study proposes a new model instead of Proof of Work (PoW) for forming the consensus group that allows the use of BFT based methods in the public blockchain network. The proposed model uses the adaptive hedge method, which is a decision-theoretic online learning algorithm (Qi et al., 2016). The reputation value is calculated for the nodes that want to participate in the consensus committee, and nodes with high reputation values are selected for the consensus committee to reduce the chances of the nodes in the consensus committee being harmful. Since the study focuses on the formation of the consensus group, a simulated blockchain network is used to test the proposed model more effectively. Test results indicate that the proposed model, which is a new approach in the literature making use of machine learning for the construction of consensus committee, successfully selects the node with the higher reputation for the consensus group. (C) 2019 Elsevier B.V. All rights reserved.
Citation - WoS: 5
Citation - Scopus: 8
Predicting the severity of COVID-19 patients using a multi-threaded evolutionary feature selection algorithm
(Wiley, 2022) Deniz, Ayca; Kiziloz, Hakan Ezgi; Sevinc, Ender; Dokeroglu, Tansel; 234173; Yazılım Mühendisliği
The COVID-19 pandemic has huge effects on the global community and an extreme burden on health systems. There are more than 185 million confirmed cases and 4 million deaths as of July 2021. Besides, the exponential rise in COVID-19 cases requires a quick prediction of the patients' severity for better treatment. In this study, we propose a Multi-threaded Genetic feature selection algorithm combined with Extreme Learning Machines (MG-ELM) to predict the severity level of the COVID-19 patients. We conduct a set of experiments on a recently published real-world dataset. We reprocess the dataset via feature construction to improve the learning performance of the algorithm. Upon comprehensive experiments, we report the most impactful features and symptoms for predicting the patients' severity level. Moreover, we investigate the effects of multi-threaded implementation with statistical analysis. In order to verify the efficiency of MG-ELM, we compare our results with traditional and state-of-the-art techniques. The proposed algorithm outperforms other algorithms in terms of prediction accuracy.
Citation - WoS: 4
Citation - Scopus: 5
Ranking surgical skills using an attention-enhanced Siamese network with piecewise aggregated kinematic data
(Springer Heidelberg, 2022) Ogul, Burcin Buket; Gilgien, Matthias; Ozdemir, Suat; Yazılım Mühendisliği
Purpose Surgical skill assessment using computerized methods is considered to be a promising direction in objective performance evaluation and expert training. In a typical architecture for computerized skill assessment, a classification system is asked to assign a query action to a predefined category that determines the surgical skill level. Since such systems are still trained by manual, potentially inconsistent annotations, an attempt to categorize the skill level can be biased by potentially scarce or skew training data. Methods We approach the skill assessment problem as a pairwise ranking task where we compare two input actions to identify better surgical performance. We propose a model that takes two kinematic motion data acquired from robot-assisted surgery sensors and report the probability of a query sample having a better skill than a reference one. The model is an attention-enhanced Siamese Long Short-Term Memory Network fed by piecewise aggregate approximation of kinematic data. Results The proposed model can achieve higher accuracy than existing models for pairwise ranking in a common dataset. It can also outperform existing regression models when applied in their experimental setup. The model is further shown to be accurate in individual progress monitoring with a new dataset, which will serve as a strong baseline. Conclusion This relative assessment approach may overcome the limitations of having consistent annotations to define skill levels and provide a more interpretable means for objective skill assessment. Moreover, the model allows monitoring the skill development of individuals by comparing two activities at different time points.

Browse

Browsing Yazılım Mühendisliği Bölümü by WoS Q "Q2"