Credit rating is the evaluation of the likelihood of an obligor to default on a loan. Each obligor in the bank’s credit portfolio isassigned to a certain rating class, or PD (probability of default) bucket; all obligors in a PD bucket then receive the same “pooled”PD, based on which a capital charge against credit risk must be computed. The only analytical approach to this problem is basedon k-means and has some limitations in practice. An error minimization approach to credit rating using differential evolution (DE)is introduced. The performances of DE and other common search heuristics are compared using credit rating data of a major Italianbank. Empirical results show that DE is clearly superior compared to a genetic algorithm (GA), particle swarm optimization (PSO),random search (RS) and two naïve partitioning approaches. Moreover, the proposed approach obtained better results than k-meansin much less runtime for a simplified instance of the problem where within-groups variances can be used for clustering.
Using Differential Evolution to improve the accuracy of bank rating systems / T, Krink; Paterlini, S.; A, Resti. - In: COMPUTATIONAL STATISTICS & DATA ANALYSIS. - ISSN 0167-9473. - 52:(2007), pp. 68-87.
Using Differential Evolution to improve the accuracy of bank rating systems
S. PATERLINI;
2007-01-01
Abstract
Credit rating is the evaluation of the likelihood of an obligor to default on a loan. Each obligor in the bank’s credit portfolio isassigned to a certain rating class, or PD (probability of default) bucket; all obligors in a PD bucket then receive the same “pooled”PD, based on which a capital charge against credit risk must be computed. The only analytical approach to this problem is basedon k-means and has some limitations in practice. An error minimization approach to credit rating using differential evolution (DE)is introduced. The performances of DE and other common search heuristics are compared using credit rating data of a major Italianbank. Empirical results show that DE is clearly superior compared to a genetic algorithm (GA), particle swarm optimization (PSO),random search (RS) and two naïve partitioning approaches. Moreover, the proposed approach obtained better results than k-meansin much less runtime for a simplified instance of the problem where within-groups variances can be used for clustering.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione