Deniz Kenan Kılıç

Dr. Deniz Kenan Kılıç

Aalborg University, Aalborg, Nordjylland, Denmark
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
13 June 2024 in Energies
Verified
Journal Article
Open access
PDF file
Deniz Kenan KılıçDeniz Kenan Kılıç
Deniz Kenan Kılıç
Peter NielsenPeter Nielsen
Peter Nielsen
ATAmila Thibbotuwawa
Amila Thibbotuwawa
For several stakeholders, including market players, customers, grid operators, policy-makers, investors, and energy efficiency initiatives, having a precise estimate of power pricing is crucial. It is easier for traders to plan, purchase, and sell power transactions with access to accurate electricity price forecasting (EPF). Although energy production and consumption topics are widely discussed in the literature, EPF and renewable energy trading studies receive less attention, especially for intraday market modeling and forecasting. Considering the rapid development of renewable energy sources, the article highlights the significance of integrating the deep learning model, long short-term memory (LSTM), with the proper trading strategy for short-term hourly renewable energy trading by utilizing two different spot markets. Day-ahead and intraday markets are taken into account for the West Denmark grid region (DK1). The time series analysis indicates that LSTM yields superior results compared to other benchmark machine learning algorithms. Using the predictions obtained by LSTM and the recommended trading strategy, promising profit values are achieved for the DK1 wind and solar energy use case, which ensures future motivation to develop a general and flexible model for global data.

7 June 2023 in Applied Soft Computing
Verified
Journal Article
Open access
Deniz Kenan KılıçDeniz Kenan Kılıç
Deniz Kenan Kılıç
ÖUÖmür Uğur
Ömür Uğur

11 May 2016 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
Deniz Kenan KılıçDeniz Kenan Kılıç
Deniz Kenan Kılıç
Deniz Kenan KılıçDeniz Kenan Kılıç
Deniz Kenan Kılıç
UĞUğur
Uğur
ÖMÖmür
Ömür

6 January 2025 in Computer Methods and Programs in Biomedicine
Verified
Journal Article
Open access
FCFrederik Christensen
Frederik Christensen
Deniz Kenan KılıçDeniz Kenan Kılıç
Deniz Kenan Kılıç
Izabela NielsenIzabela Nielsen
Izabela Nielsen
TETarec Christoffer El-Galaly
Tarec Christoffer El-Galaly
Andreas GlenthøjAndreas Glenthøj
Andreas Glenthøj
AFAlexander Djupnes Fuglkjaer
Alexander Djupnes Fuglkjaer
Around 7% of the global population has congenital hemoglobin disorders, with over 300,000 new cases of α-thalassemia annually. Diagnosis is costly and inaccurate in low-income regions, often relying on complete blood count (CBC) tests. This study employs machine learning (ML) to classify α-thalassemia traits based on gender and CBC, exploring the effects of grouping silent- and non-carriers. The dataset includes 288 individuals with suspected α-thalassemia from Sri Lanka. It was classified using eleven discriminant formulae and nine ML models. Outliers were removed using Mahalanobis distance, and resampling was conducted with the synthetic minority oversampling technique (SMOTE) and SMOTE-nominal continuous (NC). The Mann-Whitney U test handled feature extraction and class grouping. ML performance was evaluated with eight criteria. The Ehsani formula achieved an area under the receiver operating characteristic curve (ROC-AUC) of 0.66 by grouping silent- and non-carriers. The convolutional neural network (CNN) without feature extraction demonstrated better performance, with an accuracy of 0.85, sensitivity of 0.8, specificity of 0.86, and ROC-AUC of 0.95/0.93 (micro/macro). Performance was maintained even without preprocessing. ML models outperformed classical discriminant formulae in classifying α-thalassemia using sex and CBC features. A larger dataset could enhance ML model generalization and the impact of feature extraction. Grouping silent- and non-carriers improved ML results, especially with resampling. The silent carriers were not separable from non-carriers regarding the available features.

25 November 2022 in Sensors
Verified
Journal Article
Open access
PDF file
Deniz Kenan KılıçDeniz Kenan Kılıç
Deniz Kenan Kılıç
Peter NielsenPeter Nielsen
Peter Nielsen
In this study, principal component analysis and k-means clustering (PCAKM) methods for synthetic aperture radar (SAR) data are analyzed to reduce the sensitivity caused by changes in the parameters and input images of the algorithm, increase the accuracy, and make an improvement in the computation time, which are advantageous for scoring in the follow-up plan. Although there are many supervised methods described in the literature, unsupervised methods may be more appropriate in terms of computing time, data scarcity, and explainability in order to supply a trustworthy system. We consider the PCAKM algorithm, which is used as a benchmark method in many studies when making comparisons. Error metrics, computing times, and utility functions are calculated for 22 modified PCAKM regarding difference images and filtering methods. Various images with different characteristics affect the results of the configurations. However, it is evident that the PCAKM becomes less sensitive and more accurate for both the overall results and image results. Scoring by utilizing these results and other map information is a gap and innovation. Obtaining a change map in a fast, explainable, more robust and less sensitive way is one of the aims of our studies on scoring points in the follow-up plan.

21 March 2023 in Algorithms
Verified
Journal Article
Open access
PDF file
KNKasper Gaj Nielsen
Kasper Gaj Nielsen
ISInkyung Sung
Inkyung Sung
MYMohamed El Yafrani
Mohamed El Yafrani
Deniz Kenan KılıçDeniz Kenan Kılıç
Deniz Kenan Kılıç
Peter NielsenPeter Nielsen
Peter Nielsen
In this study, we tackle a key scheduling problem in a robotic arm-based food processing system, where multiple conveyors—an infeed conveyor that feeds food items to robotic arms and two tray lane conveyors, on which trays to batch food items are placed—are implemented. The target scheduling problem is to determine what item on an infeed conveyor belt is picked up by which robotic arm at what position, and on which tray the picked up item will be placed. This problem involves critical constraints, such as sequence-dependent processing time and dynamic item and tray positions. Moreover, due to the speed of the infeed conveyor and latency in the information about entering items into the system, this scheduling problem must be solved in near real time. To address these challenges, we propose a scheduling solution that first decomposes the original scheduling problem into sub-problems, where a sub-problem formulated as a goal program schedules robotic arms only for a single tray. The performance of the proposed solution approach is then tested under a simulation environment, and from the experiments, the proposed approach produces acceptable performance.