Sürdürülebilir Kalkınma Amaçları
Yayınlar
- MakaleAçık Erişim2025Future of Clean Cooking Energy Access in Emerging Economies by 2030
Cakir, Mehmet Ali; Unlu, Ramazan; Cakir, Sümeyra Cay; Xanthopoulos, Petros
This study assesses the future of clean energy and technology access for cooking in emerging economic blocs—BRICS, MINT, ASEAN, and MENA—through 2030. Cooking contributes 3% of global greenhouse gas emissions, with over half of household emissions coming from cooking. Therefore, clean cooking energy is critical for sustainability and human health. The study aims to evaluate the likelihood of achieving the UN Sustainable Development Goal of universal clean cooking energy access by 2030 and the 2050 net-zero emissions target. Machine learning techniques, such as support vector regression, gradient boosting, and linear regression, alongside an ensemble approach, provide forecasts for these regions. The findings show a varied outlook. Within ASEAN, two countries are expected to reach 100% clean energy access for cooking by 2030, while two are likely to experience a decline. The MENA region shows stronger progress, with eight countries expected to meet the 2030 target. Among BRICS countries, only India is projected to reach full accessibility, while Russia faces a decline. The MINT countries face challenges, with none expected to meet the target, and Nigeria is projected to experience a decrease in clean energy access. The study concludes that the current trajectory makes achieving the 2030 Sustainable Development Goals and the 2050 net-zero emissions target unlikely for these regions. Policymakers must reassess their strategies and learn from successful countries to improve outcomes.
- MakaleYalnız künye2021A reduced variance unsupervised ensemble learning algorithm based on modern portfolio theory
Ünlü, Ramazan; Xanthopoulos, Petros
Unsupervised ensemble learning or consensus clustering has gained popularity due to its ability to combine multiple clustering solutions into a single solution that is robust and often performs better than the individual ones. There have been several approaches to consensus clustering including voting and weighted voting algorithmic schemes. Although there have been several algorithms for adjusting the weights of a consensus clustering all of them are tuned based on some performance characteristic associated with clustering accuracy. In this paper, we propose a method for incorporating weights by taking into consideration the intra algorithmic variability i.e. algorithms that provide solutions with very different performance upon multiple runs. The methodology is inspired by modern portfolio theory and more specifically from Markowitz model for asset allocation where one is trying to identify the most efficient portfolio through the solution of a convex optimization problem. Here, efficiency is defined as the minimum amount of risk for an expected return. We apply this method to different datasets and compare with respect to performance and robustness. The proposed scheme appears to achieve competitive average performance with very low variability.
- MakaleYalnız künye2019Estimating the number of clusters in a dataset via consensus clustering
Ünlü, Ramazan; Xanthopoulos, Petros
In unsupervised learning, the problem of finding the appropriate number of clusters -usually notated as k- is very challenging. Its importance lies in the fact that k is a vital hyperparameter for the most clustering algorithms. One algorithmic approach for tacking this problem is to apply a certain clustering algorithm with various cluster configurations and decide to use the one that maximizes a certain internal validity measure. This is a promising and computationally efficient approach since the independent runs are parallelizable. In this paper, we attempt to improve over this estimation approach by incorporating a consensus clustering approach into k estimating scheme. The weighted consensus clustering scheme employs four different indices namely Silhouette (SH), Calinski–Harabasz (CH), Davies–Bouldin (DB), and Consensus (CI) indices to estimate the correct number of cluster. Computational experiments in a dataset with clusters ranging from 2 to 7 show the profound advantages of weighted consensus clustering for correctly finding k in comparison to individual clustering method (e.g, k-means) and simple consensus clustering.