Doğukan AKSU

Mr. Doğukan AKSU


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 September 2018
Verified
Book Chapter
Closed access
PDF file
DADoğukan AKSU
Doğukan AKSU
SÜSerpil Üstebay
Serpil Üstebay
MAMuhammed Ali AYDIN
Muhammed Ali AYDIN
TATülin Atmaca
Tülin Atmaca


17 February 2025 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
DADoğukan AKSU
Doğukan AKSU
ITIsmail Hakki Toroslu
Ismail Hakki Toroslu
HDHasan Davulcu
Hasan Davulcu

11 December 2019 in arXiv
Verified
Preprint
Open access
PDF file
SKSertap Kamçı
Sertap Kamçı
DADoğukan AKSU
Doğukan AKSU
MAMuhammed Ali AYDIN
Muhammed Ali AYDIN
Unmanned vehicle technologies are an area of great interest in theory and practice today. These technologies have advanced considerably after the first applications have been implemented and cause a rapid change in human life. Autonomous vehicles are also a big part of these technologies. The most important action of a driver has to do is to follow the lanes on the way to the destination. By using image processing and artificial intelligence techniques, an autonomous vehicle can move successfully without a driver help. They can go from the initial point to the specified target by applying pre-defined rules. There are also rules for proper tracking of the lanes. Many accidents are caused due to insufficient follow-up of the lanes and non-compliance with these rules. The majority of these accidents also result in injury and death. In this paper, we present an autonomous vehicle prototype that follows lanes via image processing techniques, which are a major part of autonomous vehicle technology. Autonomous movement capability is provided by using some image processing algorithms such as canny edge detection, Sobel filter, etc. We implemented and tested these algorithms on the vehicle. The vehicle detected and followed the determined lanes. By that way, it went to the destination successfully.

8 December 2020 in Disease Markers
Verified
Journal Article
Open access
HYHulya Yazici
Hulya Yazici
DODemet Akdeniz Odemis
Demet Akdeniz Odemis
DADoğukan AKSU
Doğukan AKSU
OEOzge Sukruoglu Erdogan
Ozge Sukruoglu Erdogan
STSeref Bugra Tuncer
Seref Bugra Tuncer
MAMuhammed Ali AYDIN
Muhammed Ali AYDIN
New Approach for Risk Estimation Algorithms of BRCA1/2 Negativeness Detection with Modelling Supervised Machine Learning Techniques: BRCA1/2 gene testing is a difficult, expensive, and time-consuming test which requires excessive work load. The identification of the BRCA1/2 gene mutations is significantly important in the selection of treatment and the risk of secondary cancer. We aimed to develop an algorithm considering all the clinical, demographic, and genetic features of patients for identifying the BRCA1/2 negativity in the present study. An experimental dataset was created with the collection of the all clinical, demographic, and genetic features of breast cancer patients for 20 years. This dataset consisted of 125 features of 2070 high-risk breast cancer patients. All data were numeralized and normalized for detection of the BRCA1/2 negativity in the machine learning algorithm. The performance of the algorithm was identified by studying the machine learning model with the test data. nearest neighbours (KNN) and decision tree (DT) accuracy rates of 9 features involving Dataset 2 were found to be the most effective. The removal of the unnecessary data in the dataset by reducing the number of features was shown to increase the accuracy rate of algorithm compared with the DT. BRCA1/2 negativity was identified without performing the BRCA1/2 gene test with 92.88% accuracy within minutes in high-risk breast cancer patients with this algorithm, and the test associated result waiting stress, time, and money loss were prevented. That algorithm is suggested be useful in fast performing of the treatment plans of patients and accurately in addition to speeding up the clinical practice.

13 September 2024 in arXiv
Verified
Preprint
Open access
PDF file
DADoğukan AKSU
Doğukan AKSU
ITIsmail Hakki Toroslu
Ismail Hakki Toroslu
HDHasan Davulcu
Hasan Davulcu
Click-through-rate (CTR) prediction plays an important role in online advertising and ad recommender systems. In the past decade, maximizing CTR has been the main focus of model development and solution creation. Therefore, researchers and practitioners have proposed various models and solutions to enhance the effectiveness of CTR prediction. Most of the existing literature focuses on capturing either implicit or explicit feature interactions. Although implicit interactions are successfully captured in some studies, explicit interactions present a challenge for achieving high CTR by extracting both low-order and high-order feature interactions. Unnecessary and irrelevant features may cause high computational time and low prediction performance. Furthermore, certain features may perform well with specific predictive models while underperforming with others. Also, feature distribution may fluctuate due to traffic variations. Most importantly, in live production environments, resources are limited, and the time for inference is just as crucial as training time. Because of all these reasons, feature selection is one of the most important factors in enhancing CTR prediction model performance. Simple filter-based feature selection algorithms do not perform well and they are not sufficient. An effective and efficient feature selection algorithm is needed to consistently filter the most useful features during live CTR prediction process. In this paper, we propose a heuristic algorithm named Neighborhood Search with Heuristic-based Feature Selection (NeSHFS) to enhance CTR prediction performance while reducing dimensionality and training time costs. We conduct comprehensive experiments on three public datasets to validate the efficiency and effectiveness of our proposed solution.