{"title":"Assessing loan eligibility through correlation matrix approximation for credit estimation","authors":"Hajar A. Alshaikh, Suliman S. Al-Homidan","doi":"10.1007/s13370-025-01303-y","DOIUrl":null,"url":null,"abstract":"<div><p>The correlation problem is a central focus in statistical analysis and data science, as it aims to quantify the relationships between variables. This paper explores efficient methods for approximating correlation matrices to assess loan eligibility for bank customers. We propose a novel algorithm that utilizes advanced optimization techniques to minimize the difference between actual noisy matrices and approximated correlation matrices. The algorithm is designed for large-scale correlation matrices, such as those with thousands of variables, and employs the interior point primal-dual path-following method. We provide a comprehensive comparative analysis of our methods and the commonly used modified alternating projection method, evaluating their efficacy and computational efficiency based on numerical results.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"36 2","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Afrika Matematika","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s13370-025-01303-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The correlation problem is a central focus in statistical analysis and data science, as it aims to quantify the relationships between variables. This paper explores efficient methods for approximating correlation matrices to assess loan eligibility for bank customers. We propose a novel algorithm that utilizes advanced optimization techniques to minimize the difference between actual noisy matrices and approximated correlation matrices. The algorithm is designed for large-scale correlation matrices, such as those with thousands of variables, and employs the interior point primal-dual path-following method. We provide a comprehensive comparative analysis of our methods and the commonly used modified alternating projection method, evaluating their efficacy and computational efficiency based on numerical results.