Clustering Analysis for Credit Default Probabilities in a Retail Bank Portfolio
Journal Title: Database Systems Journal - Year 2012, Vol 3, Issue 2
Abstract
Methods underlying cluster analysis are very useful in data analysis, especially when the processed volume of data is very large, so that it becomes impossible to extract essential information, unless specific instruments are used to summarize and structure the gross information. In this context, cluster analysis techniques are used particularly, for systematic information analysis. The aim of this article is to build an useful model for banking field, based on data mining techniques, by dividing the groups of borrowers into clusters, in order to obtain a profile of the customers (debtors and good payers). We assume that a class is appropriate if it contains members that have a high degree of similarity and the standard method for measuring the similarity within a group shows the lowest variance. After clustering, data mining techniques are implemented on the cluster with bad debtors, reaching a very high accuracy after implementation. The paper is structured as follows: Section 2 describes the model for data analysis based on a specific scoring model that we proposed. In section 3, we present a cluster analysis using K-means algorithm and the DM models are applied on a specific cluster. Section 4 shows the conclusions.
Authors and Affiliations
Adela Tudor, Elena Andrei Dragomir
Cost Effective RADIUS Authentication for Wireless Clients
Network administrators need to keep administrative user information for each network device, but network devices usually support only limited functions for user management. WLAN security is a modern problem that needs to...
SOA - An Architecture Which Creates a Flexible Link between Business Processes and IT
To be viable, a company must be adapted continously to the market’s requirements. The adaption of a company to the market’s requirements means also changes in the business processes of the firm. Till several years...
Problem Decomposition Method to Compute an Optimal Cover for a Set of Functional Dependencies
The paper proposes a problem decomposition method for building optimal cover for a set of functional dependencies to decrease the solving time. At the beginning, the paper includes an overview of the covers of func...
Implementation of Cloud Computing into VoIP
This article defines Cloud Computing and highlights key concepts, the benefits of using virtualization, its weaknesses and ways of combining it with classical VoIP technologies applied to large scale businesses. The anal...
Solutions for improving data extraction from virtual data warehouses
The data warehousing project’s team is always confronted with low performance in data extraction. In a Business Intelligence environment this problem can be critical because the data displayed are no longer available for...