Loan products and credit scoring methods by commercial banks

This study describes the loan products offered by the commercial banks and credit scoring techniques used for classifying risks and granting credit to the applicants in India. The loan products offered by commercial banks are: Housing loans, Personal loans, Business loan, Education loans, Vehicle loans etc. All the loan products are categorized as secures and unsecured loans. Credit scoring techniques used for both secured as well as unsecured loans are broadly divided into two categories as Advanced Statistical Methods and Traditional Statistical Methods.peer-reviewe

Diverse Partner Selection with Brood Recombination in Genetic Programming

The ultimate goal of learning algorithms is to find the best solution from a search space without testing each and every solution available in the search space. During the evolution process new solutions (children) are produced from existing solutions (parents), where new solutions are expected to be better than existing solutions. This paper presents a new parent selection method for the crossover operation in genetic programming. The idea is to promote crossover between two behaviourally (phenotype) diverse parents such that the probability of children being better than their parents increases. The relative phenotype strengths and weaknesses of pairs of parents are exploited to find out if their crossover is beneficial or not (diverse partner selection (DPS)). Based on the probable improvement in children compared to their parents, crossover is either allowed or disallowed. The parents qualifying for crossover through this process are expected to produce much better children and are allowed to produce more children than normal parents through brood recombination (BR). BR helps to explore the search space around diverse parents much more efficiently. Experimental results from different benchmarking problems demonstrate that the proposed method (DPS with BR) improves the performance of genetic programming significantly

Desarrollo y simplificación de redes de neuronas artificiales mediante el uso de técnicas de computación evolutiva

[Resumen] Esta Tesis propone el uso de técnicas de Computación Evolutiva (CE) con el objetivo de automatizar el proceso de desarrollo de Redes de Neuronas Artificiales (RR,NN.AA.). Tradicionalmente, el desarrollo de RR.NN.AA. es un proceso lento, marcado por el gran trabajo que debe de realizar el experto. Por su parte, los métodos existentes para el desarrollo automatizado de RR.NN.AA. han sido analizados, y como resultado se han hallado una serie de carencias graves. Con el objetivo de paliar estas carencias, y de lograr un sistema totalmente automatizado en todas las etapas de desarrollo de RR.NN.AA., se propone el uso de dos técnicas de CE: Programación Genética (PG) y Algoritmos Genéticos (AA.GG.) para lograr un modelo que tenga dichas características. Los resultados obtenidos en los experimentos realizados, así como en la comparación del modelo desarrollado con los existentes, muestran una alta eficiencia del sistema desarrollado, así como una serie de ventajas tales como una optimización de las redes conseguidas.Esta Tesis propone el uso de técnicas de Computación Evolutiva (CE) con el objetivo de automatizar el proceso de desarrollo de Redes de Neuronas Artificiales (RR.NN.AA.). Tradicionalmente, el desarrollo de RR.NN.AA. es un proceso lento, marcado por el gran trabajo que debe de realizar el experto. Por su parte, los métodos existentes para el desarrollo automatizado de RR.NN.AA. han sido analizados, y como resultado se han hallado una serie de carencias graves. Con el objetivo de paliar estas carencias, y de lograr un sistema totalmente automatizado en todas las etapas de desarrollo de RR.NN.AA., se propone el uso de dos técnicas de CE: Programación Genética (PG) y Algoritmos Genéticos (AA.GG.) para lograr un modelo que tenga dichas características

Internal Reinforcement in a Connectionist Genetic Programming Approach

Genetic programming (GP) is a successful machine learning technique that provides powerful parameterized program primitive constructs using evolution as its search mechanism. However, unlike some machine learning techniques, such as Artificial Neural Networks (ANNs), GP does not have a principled procedure for changing parts of a learned structure based on that structure's past performance. GP is missing a clear, locally optimal update procedure, the equivalent of gradient-descent backpropagation for ANNs. In this article, we introduce a new mechanism for defining and using performance feedback on program evolution. This "internal reinforcement" principled algorithm is implemented within a new connectionist representation for evolving parameterized programs, namely "neural programming." We present the algorithms for the generation of credit and blame assignment in the process of learning programs using neural programming and internal reinforcement. The article includes a brief overview..