Bahaeddin Turkoglu

Dr. Bahaeddin Turkoglu


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
23 February 2022 in Applied Soft Computing
Verified
Journal Article
Closed access
BTBahaeddin Turkoglu
Bahaeddin Turkoglu
Sait Ali UymazSait Ali Uymaz
Sait Ali Uymaz
EKErsin KAYA
Ersin KAYA

13 December 2024 in Sensors
Verified
Journal Article
Open access
PDF file
MKMahmut KARAASLAN
Mahmut KARAASLAN
BTBahaeddin Turkoglu
Bahaeddin Turkoglu
EKErsin KAYA
Ersin KAYA
TATunc Asuroglu
Tunc Asuroglu
Extracting behavioral information from animal sounds has long been a focus of research in bioacoustics, as sound-derived data are crucial for understanding animal behavior and environmental interactions. Traditional methods, which involve manual review of extensive recordings, pose significant challenges. This study proposes an automated system for detecting and classifying animal vocalizations, enhancing efficiency in behavior analysis. The system uses a preprocessing step to segment relevant sound regions from audio recordings, followed by feature extraction using Short-Time Fourier Transform (STFT), Mel-frequency cepstral coefficients (MFCCs), and linear-frequency cepstral coefficients (LFCCs). These features are input into convolutional neural network (CNN) classifiers to evaluate performance. Experimental results demonstrate the effectiveness of different CNN models and feature extraction methods, with AlexNet, DenseNet, EfficientNet, ResNet50, and ResNet152 being evaluated. The system achieves high accuracy in classifying vocal behaviors, such as barking and howling in dogs, providing a robust tool for behavioral analysis. The study highlights the importance of automated systems in bioacoustics research and suggests future improvements using deep learning-based methods for enhanced classification performance.

1 July 2024 in Arabian Journal for Science and Engineering
Verified
Journal Article
Open access
PDF file
BTBahaeddin Turkoglu
Bahaeddin Turkoglu
Sait Ali UymazSait Ali Uymaz
Sait Ali Uymaz
EKErsin KAYA
Ersin KAYA
The artificial algae algorithm (AAA) is a recently introduced metaheuristic algorithm inspired by the behavior and characteristics of microalgae. Like other metaheuristic algorithms, AAA faces challenges such as local optima and premature convergence. Various strategies to address these issues and enhance the performance of the algorithm have been proposed in the literature. These include levy flight, local search, variable search, intelligent search, multi-agent systems, and quantum behaviors. This paper introduces chaos theory as a strategy to improve AAA's performance. Chaotic maps are utilized to effectively balance exploration and exploitation, prevent premature convergence, and avoid local minima. Ten popular chaotic maps are employed to enhance AAA's performance, resulting in the chaotic artificial algae algorithm (CAAA). CAAA's performance is evaluated on thirty benchmark test functions, including unimodal, multimodal, and fixed dimension problems. The algorithm is also tested on three classical engineering problems and eight space trajectory design problems at the European Space Agency. A statistical analysis using the Friedman and Wilcoxon tests confirms that CAA demonstrates successful performance in optimization problems.

19 March 2025 in IEEE Access
Verified
Journal Article
Open access
MKMuhammed Abdulhamid Karabiyik
Muhammed Abdulhamid Karabiyik
BTBahaeddin Turkoglu
Bahaeddin Turkoglu
TATunc Asuroglu
Tunc Asuroglu
The performance of artificial neural networks heavily depends on the optimization of network parameters, specifically weights and biases, during the training process. Effectively adjusting these parameters is essential to minimize the error between predicted and actual outputs. While traditional training algorithms, such as gradient-based methods, have been widely used, they often face challenges like premature convergence and stagnation in local optima. Training an ANN can, therefore, be viewed as an optimization problem, where the goal is to fine-tune parameters to achieve accurate and efficient performance. In this study, we introduce a novel approach to optimizing neural network parameters using the Mountain Gazelle Optimizer (MGO), a nature-inspired metaheuristic algorithm that mimics the social hierarchy and behavioral patterns of wild mountain gazelles. The MGO algorithm leverages its unique features, including hierarchical social structure and adaptive movement strategies, to effectively navigate the complex parameter space of neural networks. The algorithm’s search mechanism integrates four key behavioral strategies: Territorial Solitary Males (TSM) for refining optimal solutions, Maternity Herds (MH) for balancing exploration and exploitation, Bachelor Male Herds (BMH) for global exploration, and Migration to Search for Food (MSF) for introducing randomness to prevent stagnation in local optima. These mechanisms work collaboratively, ensuring a dynamic and balanced optimization process throughout the training phase. To evaluate the effectiveness of the proposed approach, we conducted comprehensive experiments using various classification datasets from the UCI repository. The performance of the MGO-based neural network optimizer was compared with traditional backpropagation and several state-of-the-art optimization algorithms. Experimental results demonstrate that the proposed method exhibits superior performance in terms of convergence speed and avoiding local optima, suggesting that MGO is a promising alternative for optimizing artificial neural networks during training.

22 March 2023 in Engineering Science and Technology, an International Journal
Verified
Journal Article
Open access
HKHavva Gül Koçer
Havva Gül Koçer
BTBahaeddin Turkoglu
Bahaeddin Turkoglu
Sait Ali UymazSait Ali Uymaz
Sait Ali Uymaz

5 August 2024 in IEEE Access
Verified
Journal Article
Open access
OUOğuzhan Uymaz
Oğuzhan Uymaz
BTBahaeddin Turkoglu
Bahaeddin Turkoglu
EKErsin KAYA
Ersin KAYA
TATunc Asuroglu
Tunc Asuroglu
Galactic Swarm Optimization (GSO) is an optimization method inspired by the movements of stars and star clusters in the galaxy. This method aims to find the best solution in two phases using other known optimization methods. The first phase explores the search space, while the second phase tries to refine the best solution. In GSO, the population of the best individuals obtained from the first phase is used as the initial population for the second phase. This process is repeated until the stopping criterion is met. Although the knowledge obtained from the first phase is transferred to the second phase in GSO, there is no knowledge transfer from the second phase to the first phase. In this study, we propose a modification where the knowledge obtained in the second phase is transferred back to the first phase. Additionally, the Particle Swarm Optimization (PSO) method, used as the search method in the original study, has a fast convergence problem, which hinders an effective discovery process in the first phase of GSO. To address this, the proposed diversity-guided modification regulates population diversity and enhances exploration. To demonstrate the performance of the proposed method, twenty-six traditional benchmark functions and three engineering design problems were used. The proposed method was compared with the original GSO and six current optimization methods. The results of the experimental study were analyzed using statistical tests. The experimental results and analyses show that the proposed method performs successfully.