• Title/Summary/Keyword: Credit Prediction

Search Result 82, Processing Time 0.022 seconds

Fuzzy Indexing and Retrieval in CBR with Weight Optimization Learning for Credit Evaluation

  • Park, Cheol-Soo;Ingoo Han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.491-501
    • /
    • 2002
  • Case-based reasoning is emerging as a leading methodology for the application of artificial intelligence. CBR is a reasoning methodology that exploits similar experienced solutions, in the form of past cases, to solve new problems. Hybrid model achieves some convergence of the wide proliferation of credit evaluation modeling. As a result, Hybrid model showed that proposed methodology classify more accurately than any of techniques individually do. It is confirmed that proposed methodology predicts significantly better than individual techniques and the other combining methodologies. The objective of the proposed approach is to determines a set of weighting values that can best formalize the match between the input case and the previously stored cases and integrates fuzzy sit concepts into the case indexing and retrieval process. The GA is used to search for the best set of weighting values that are able to promote the association consistency among the cases. The fitness value in this study is defined as the number of old cases whose solutions match the input cases solution. In order to obtain the fitness value, many procedures have to be executed beforehand. Also this study tries to transform financial values into category ones using fuzzy logic approach fur performance of credit evaluation. Fuzzy set theory allows numerical features to be converted into fuzzy terms to simplify the matching process, and allows greater flexibility in the retrieval of candidate cases. Our proposed model is to apply an intelligent system for bankruptcy prediction.

  • PDF

Prediction and Classification Using Projection Pursuit Regression with Automatic Order Selection

  • Park, Heon Jin;Choi, Daewoo;Koo, Ja-Yong
    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.2
    • /
    • pp.585-596
    • /
    • 2000
  • We developed a macro for prediction and classification using profection pursuit regression based on Friedman (1984b) and Hwang, et al. (1994). In the macro, the order of the Hermite functions can be selected automatically. In projection pursuit regression, we compare several smoothing methods such as super smoothing, smoothing with the Hermite functions. Also, classification methods applied to German credit data are compared.

  • PDF

Comparisons of the corporate credit rating model power under various conditions (기준값 변화에 따른 기업신용평가모형 성능 비교)

  • Ha, Jeongcheol;Kim, Soojin
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.6
    • /
    • pp.1207-1216
    • /
    • 2015
  • This study aims to compare the model power in developing corporate credit rating models and to suggest a good way to build models based on the characteristic of data. Among many measurement methods, AR is used to measure the model power under various conditions. SAS/MACRO is in use for similar repetitions to reduce time to build models under several combination of conditions. A corporate credit rating model is composed of two sub-models; a credit scoring model and a default prediction model. We verify that the latter performs better than the former under various conditions. From the result of size comparisons, models of large size corporate are more powerful and more meaningful in financial viewpoint than those of small size corporate. As a corporate size gets smaller, the gap between sub-models becomes huge and the effect of outliers becomes serious.

Improving an Ensemble Model Using Instance Selection Method (사례 선택 기법을 활용한 앙상블 모형의 성능 개선)

  • Min, Sung-Hwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.1
    • /
    • pp.105-115
    • /
    • 2016
  • Ensemble classification involves combining individually trained classifiers to yield more accurate prediction, compared with individual models. Ensemble techniques are very useful for improving the generalization ability of classifiers. The random subspace ensemble technique is a simple but effective method for constructing ensemble classifiers; it involves randomly drawing some of the features from each classifier in the ensemble. The instance selection technique involves selecting critical instances while deleting and removing irrelevant and noisy instances from the original dataset. The instance selection and random subspace methods are both well known in the field of data mining and have proven to be very effective in many applications. However, few studies have focused on integrating the instance selection and random subspace methods. Therefore, this study proposed a new hybrid ensemble model that integrates instance selection and random subspace techniques using genetic algorithms (GAs) to improve the performance of a random subspace ensemble model. GAs are used to select optimal (or near optimal) instances, which are used as input data for the random subspace ensemble model. The proposed model was applied to both Kaggle credit data and corporate credit data, and the results were compared with those of other models to investigate performance in terms of classification accuracy, levels of diversity, and average classification rates of base classifiers in the ensemble. The experimental results demonstrated that the proposed model outperformed other models including the single model, the instance selection model, and the original random subspace ensemble model.

Using Estimated Probability from Support Vector Machines for Credit Rating in IT Industry

  • Hong, Tae-Ho;Shin, Taek-Soo
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.11a
    • /
    • pp.509-515
    • /
    • 2005
  • Recently, support vector machines (SVMs) are being recognized as competitive tools as compared with other data mining techniques for solving pattern recognition or classification decision problems. Furthermore, many researches, in particular, have proved it more powerful than traditional artificial neural networks (ANNs)(Amendolia et al., 2003; Huang et al., 2004, Huang et al., 2005; Tay and Cao, 2001; Min and Lee, 2005; Shin et al, 2005; Kim, 2003). The classification decision, such as a binary or multi-class decision problem, used by any classifier, i.e. data mining techniques is cost-sensitive. Therefore, it is necessary to convert the output of the classifier into well-calibrated posterior probabilities. However, SVMs basically do not provide such probabilities. So it required to use any method to create probabilities (Platt, 1999; Drish, 2001). This study applies a method to estimate the probability of outputs of SVM to bankruptcy prediction and then suggests credit scoring methods using the estimated probability for bank's loan decision making.

  • PDF

Artificial Intelligence Techniques for Predicting Online Peer-to-Peer(P2P) Loan Default (인공지능기법을 이용한 온라인 P2P 대출거래의 채무불이행 예측에 관한 실증연구)

  • Bae, Jae Kwon;Lee, Seung Yeon;Seo, Hee Jin
    • The Journal of Society for e-Business Studies
    • /
    • v.23 no.3
    • /
    • pp.207-224
    • /
    • 2018
  • In this article, an empirical study was conducted by using public dataset from Lending Club Corporation, the largest online peer-to-peer (P2P) lending in the world. We explore significant predictor variables related to P2P lending default that housing situation, length of employment, average current balance, debt-to-income ratio, loan amount, loan purpose, interest rate, public records, number of finance trades, total credit/credit limit, number of delinquent accounts, number of mortgage accounts, and number of bank card accounts are significant factors to loan funded successful on Lending Club platform. We developed online P2P lending default prediction models using discriminant analysis, logistic regression, neural networks, and decision trees (i.e., CART and C5.0) in order to predict P2P loan default. To verify the feasibility and effectiveness of P2P lending default prediction models, borrower loan data and credit data used in this study. Empirical results indicated that neural networks outperforms other classifiers such as discriminant analysis, logistic regression, CART, and C5.0. Neural networks always outperforms other classifiers in P2P loan default prediction.

Empirical Research on Cyclical Patterns of R&D Investment (R&D 투자의 경기순환적 특성에 관한 연구)

  • Lee, U-Seong
    • Journal of Technology Innovation
    • /
    • v.16 no.2
    • /
    • pp.147-165
    • /
    • 2008
  • The researches on cyclical patterns of R&D investment has a long history in developed economies since the Schumpeterian hypothesis that long-term productivity-enhancing innovative activities increase during recession. But in Korea the cyclical patterns of R&D investment is one of the unexplored academic areas. Unlike theoretical explanation of R&D's cyclical pattern, empirical results has shown that R&D investment is procyclical to business cycles in developed countries. This paper investigates whether Korean R&D investment show procyclical or countercyclical pattern to business cycles. The empirical results show that Korean R&D investment in private area is procyclical to business cycles with statistical significance, which confirms the credit-constraint theory's prediction, while public area's is not sensitive to them. Public R&D investment has long-term investment characteristics and can be utilized to stabilize procyclically-fluctuating private R&D investment.

  • PDF

Customer-based Recommendation Model for Next Merchant Recommendation

  • Bayartsetseg Kalina;Ju-Hong Lee
    • Smart Media Journal
    • /
    • v.12 no.5
    • /
    • pp.9-16
    • /
    • 2023
  • In the recommendation system of the credit card company, it is necessary to understand the customer patterns to predict a customer's next merchant based on their histories. The data we want to model is much more complex and there are various patterns that customers choose. In such a situation, it is necessary to use an effective model that not only shows the relevance of the merchants, but also the relevance of the customers relative to these merchants. The proposed model aims to predict the next merchant for the customer. To improve prediction performance, we propose a novel model, called Customer-based Recommendation Model (CRM), to produce a more efficient representation of customers. For the next merchant recommendation system, we use a synthetic credit card usage dataset, BC'17. To demonstrate the applicability of the proposed model, we also apply it to the next item recommendation with another real-world transaction dataset, IJCAI'16.

Bankruptcy Prediction with Explainable Artificial Intelligence for Early-Stage Business Models

  • Tuguldur Enkhtuya;Dae-Ki Kang
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.58-65
    • /
    • 2023
  • Bankruptcy is a significant risk for start-up companies, but with the help of cutting-edge artificial intelligence technology, we can now predict bankruptcy with detailed explanations. In this paper, we implemented the Category Boosting algorithm following data cleaning and editing using OpenRefine. We further explained our model using the Shapash library, incorporating domain knowledge. By leveraging the 5C's credit domain knowledge, financial analysts in banks or investors can utilize the detailed results provided by our model to enhance their decision-making processes, even without extensive knowledge about AI. This empowers investors to identify potential bankruptcy risks in their business models, enabling them to make necessary improvements or reconsider their ventures before proceeding. As a result, our model serves as a "glass-box" model, allowing end-users to understand which specific financial indicators contribute to the prediction of bankruptcy. This transparency enhances trust and provides valuable insights for decision-makers in mitigating bankruptcy risks.

Option-type Default Forecasting Model of a Firm Incorporating Debt Structure, and Credit Risk (기업의 부채구조를 고려한 옵션형 기업부도예측모형과 신용리스크)

  • Won, Chae-Hwan;Choi, Jae-Gon
    • The Korean Journal of Financial Management
    • /
    • v.23 no.2
    • /
    • pp.209-237
    • /
    • 2006
  • Since previous default forecasting models for the firms evaluate the probability of default based upon the accounting data from book values, they cannot reflect the changes in markets sensitively and they seem to lack theoretical background. The market-information based models, however, not only make use of market data for the default prediction, but also have strong theoretical background like Black-Scholes (1973) option theory. So, many firms recently use such market based model as KMV to forecast their default probabilities and to manage their credit risks. Korean firms also widely use the KMV model in which default point is defined by liquid debt plus 50% of fixed debt. Since the debt structures between Korean and American firms are significantly different, Korean firms should carefully use KMV model. In this study, we empirically investigate the importance of debt structure. In particular, we find the following facts: First, in Korea, fixed debts are more important than liquid debts in accurate prediction of default. Second, the percentage of fixed debt must be less than 20% when default point is calculated for Korean firms, which is different from the KMV. These facts give Korean firms some valuable implication about default forecasting and management of credit risk.

  • PDF