Gürcan Yavuz

Dr. Gürcan Yavuz

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 February 2022 in Applied Soft Computing
Verified
Journal Article
Closed access
GYGürcan Yavuz
Gürcan Yavuz
BDBurhanettin Durmuş
Burhanettin Durmuş
DADoğan Aydın
Doğan Aydın

29 February 2016 in Applied Computational Intelligence and Soft Computing
Verified
Journal Article
Open access
PDF file
GYGürcan Yavuz
Gürcan Yavuz
DADoğan Aydin
Doğan Aydin
Optimal feature subset selection is an important and a difficult task for pattern classification, data mining, and machine intelligence applications. The objective of the feature subset selection is to eliminate the irrelevant and noisy feature in order to select optimum feature subsets and increase accuracy. The large number of features in a dataset increases the computational complexity thus leading to performance degradation. In this paper, to overcome this problem, angle modulation technique is used to reduce feature subset selection problem to four-dimensional continuous optimization problem instead of presenting the problem as a high-dimensional bit vector. To present the effectiveness of the problem presentation with angle modulation and to determine the efficiency of the proposed method, six variants of Artificial Bee Colony (ABC) algorithms employ angle modulation for feature selection. Experimental results on six high-dimensional datasets show that Angle Modulated ABC algorithms improved the classification accuracy with fewer feature subsets.

6 August 2024 in Journal of Computational Electronics
Verified
Journal Article
Closed access
PDF file
HTHasan Temurtaş
Hasan Temurtaş
GYGürcan Yavuz
Gürcan Yavuz
SÖSerdar Özyön
Serdar Özyön
AÜAybüke Ünlü
Aybüke Ünlü

6 November 2023 in Swarm Intelligence
Verified
Journal Article
Closed access
PDF file
DADoğan Aydın
Doğan Aydın
YÖYunus Özcan
Yunus Özcan
MSMuhammad Sulaiman
Muhammad Sulaiman
GYGürcan Yavuz
Gürcan Yavuz
ZHZahid Halim
Zahid Halim

19 February 2022 in Journal of Computational Science
Verified
Journal Article
Closed access
GYGürcan Yavuz
Gürcan Yavuz

26 September 2022 in IEEE Access
Verified
Journal Article
Open access
GYGürcan Yavuz
Gürcan Yavuz
JAYA algorithm is one a recently developed meta-heuristic algorithm that does not require algorithm-specific parameters. It is an algorithm based on the fact that the solutions always go towards the best when searching. This paper proposes a JAYA variant (JAYA-SIP) with three improvements to the Original JAYA algorithm. It has incorporated the senior learning strategy, the incremental population strategy, and Powell’s local search method into JAYA. The improvements were tested with IEEE Congress on Evolutionary Computation (CEC) benchmark set for 30 and 50 dimensions, and the benchmark functions set from a special issue of the Soft Computing journal (SOCO) for 500 and 1000 dimensions. In addition to benchmark sets, the performance of JAYA-SIP was evaluated with nine CEC 2011 real-world test functions. The results of the proposed algorithm are compared with JAYA variants and some meta-heuristic algorithms. According to the results of the experiment and the analysis, the proposed improvements increased the performance of the JAYA algorithm. JAYA-SIP achieved better results than the other algorithms it was compared with.