%0 Journal Article %1 Huang:Tgp:06 %A Huang, Jih-Jeng %A Tzeng, Gwo-Hshiung %A Ong, Chorng-Shyong %D 2006 %J Applied Mathematics and Computation %K (2SGP) (ANN), Artificial Credit Decision Rough Two-stage algorithms, genetic model, network neural programming programming, scoring sets, trees, %N 2 %P 1039--1053 %R doi:10.1016/j.amc.2005.05.027 %T Two-stage genetic programming (2SGP) for the credit scoring model %U http://www.scorto.ru/downloads/Two-stage%20genetic%20programming%20(2SGP)%20for%20the%20credit%20scoring%20model.pdf %V 174 %X Credit scoring models have been widely studied in the areas of statistics, machine learning, and artificial intelligence (AI). Many novel approaches such as artificial neural networks (ANNs), rough sets, or decision trees have been proposed to increase the accuracy of credit scoring models. Since an improvement in accuracy of a fraction of a percent might translate into significant savings, a more sophisticated model should be proposed for significantly improving the accuracy of the credit scoring models. In this paper, two-stage genetic programming (2SGP) is proposed to deal with the credit scoring problem by incorporating the advantages of the IF-THEN rules and the discriminant function. On the basis of the numerical results, we can conclude that 2SGP can provide the better accuracy than other models.

@article{Huang:Tgp:06, abstract = {Credit scoring models have been widely studied in the areas of statistics, machine learning, and artificial intelligence (AI). Many novel approaches such as artificial neural networks (ANNs), rough sets, or decision trees have been proposed to increase the accuracy of credit scoring models. Since an improvement in accuracy of a fraction of a percent might translate into significant savings, a more sophisticated model should be proposed for significantly improving the accuracy of the credit scoring models. In this paper, two-stage genetic programming (2SGP) is proposed to deal with the credit scoring problem by incorporating the advantages of the IF-THEN rules and the discriminant function. On the basis of the numerical results, we can conclude that 2SGP can provide the better accuracy than other models.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Huang, Jih-Jeng and Tzeng, Gwo-Hshiung and Ong, Chorng-Shyong}, biburl = {https://www.bibsonomy.org/bibtex/225129259121d4f3caa1952da52559f9a/brazovayeye}, doi = {doi:10.1016/j.amc.2005.05.027}, interhash = {89884a7b38fe89d5d13330f66987febd}, intrahash = {25129259121d4f3caa1952da52559f9a}, journal = {Applied Mathematics and Computation}, keywords = {(2SGP) (ANN), Artificial Credit Decision Rough Two-stage algorithms, genetic model, network neural programming programming, scoring sets, trees,}, month = {15 March}, number = 2, pages = {1039--1053}, timestamp = {2008-06-19T17:41:57.000+0200}, title = {Two-stage genetic programming {(2SGP)} for the credit scoring model}, url = {http://www.scorto.ru/downloads/Two-stage%20genetic%20programming%20(2SGP)%20for%20the%20credit%20scoring%20model.pdf}, volume = 174, year = 2006 }