TR-Dizin İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12573/396
Browse
3 results
Search Results
Article Forecasting the Consumer Price Index in Türkiye Using Machine Learning Models: A Comparative Analysis(Gazi Univ, 2025-09-01) Söylemez, İsmet; Ünlü, Ramazan; Nalici, Mehmet ErenThis study utilizes machine learning models to forecast Türkiye's Consumer Price Index (CPI), thereby addressing a critical gap in inflation prediction methodologies. The central research problem involves the forecasting of CPI in a volatile economic environment, which is essential for informed policymaking. The primary objective of this study is to evaluate the performance of three machine learning models, such as Decision Tree (DT), Random Forest (RF), and Support Vector Machine (SVM), in forecasting CPI over periods ranging from one to six months, utilizing data from 2012 to 2024. The study's unique contribution lies in the application of the \"SelectKBest\" method, which identifies the most relevant indices, thereby enhancing the efficiency of the models. An ensemble method, Averaging Voting, is also employed to combine the strengths of these models, producing more accurate and robust predictions. The findings indicate that while the RF model consistently generates the most accurate forecasts across all shifts, the SVM model demonstrates a particular strength in the domain of short-term predictions. The ensemble model demonstrates a substantial performance improvement, with a R2 value of 0.962 for one-month ahead of estimates and 0.956 for five-month forecasts. This combined approach has been shown to outperform individual models, offering a more reliable framework for CPI forecasting. The findings offer valuable insights for economic policymakers, enabling more precise and stable inflation predictions in Türkiye.Article Optimizing Parameters for Efficient Computation With Fully Homomorphic Encryption Schemes(Tubitak Scientific & Technological Research Council Turkey, 2025-03-21) Karaagac, Cavidan Yakupoglu; Rohloff, Kurt; Yakupoğlu Karaağaç, Cavidan; Yakupoglu, CavidanIn this study, we aim to provide a parameter selection approach for the BFVrns scheme, one of the prominent fully homomorphic encryption (FHE) schemes. Selecting parameters for lattice-based FHE schemes poses a practical challenge for both experts and nonexperts. To solve this problem, we introduce a hybrid approach that combines theoretical approach with experimental analysis. First, we employ regression analysis to examine the impact of parameters on both performance and security. The varying behavior of FHE parameters in terms of performance, security, and ciphertext expansion factor (CEF) makes parameter selection more challenging. To address this issue, we employ a multi-objective optimization algorithm to determine the optimal parameter set for performance, CEF, and security simultaneously. As a result of this optimization, we obtain an improved parameter set that enhances performance at a given security level while ensuring correctness and resistance to lattice-based attacks, maintaining at least 128-bit security. Our results achieve an average similar to 5x reduction in CEF and generally better performance compared to the parameter sets in a previous BFVrns study. Our approach serves as a semi-automated parameter selection method for the PALISADE homomorphic encryption library, a widely recognized FHE library. This study sets a precedent for other FHE libraries.Article Evaluation of Sub-Network Search Programs in Epilepsy-Related GWAS Dataset(Pamukkale Univ, 2022) Adanur Dedeturk, Beyhan; Bakir Gungor, Burcu; Dedeturk, Beyhan Adanur; Gungor, Burcu BakirThe active sub-network detection aims to find a group of interconnected genes of disease-related genes in a protein-protein interaction network. In recent years, several algorithms have been developed for this problem. In this study, the analysis of disease-specific sub-network identification programs is evaluated using epilepsy data set. Under the same conditions and with the same data set, 9 different programs are run and results of their Greedy algorithm, Genetic algorithm, Simulated Annealing Algorithm, MCC (Maximal Clique Centrality) algorithm, MCODE (Molecular Complex Detection) algorithm, and PEWCC (Protein Complex Detection using Weighted Clustering Coefficient) algorithm are shown. The top-scoring 5 modules of each program, are compared using fold enrichment analysis and normalized mutual information. Also, the identified subnetworks are functionally enriched using a hypergeometric test, and hence, disease-associated biological pathways are identified. In addition, running times and features of the programs are comparatively evaluated.