z-logo
open-access-imgOpen Access
Comparative Study of Classification Method on Customer Candidate Data to Predict its Potential Risk
Author(s) -
Mujiono Sadikin,
Fahri Alfiandi
Publication year - 2018
Publication title -
international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.277
H-Index - 22
ISSN - 2088-8708
DOI - 10.11591/ijece.v8i6.pp4763-4771
Subject(s) - naive bayes classifier , salary , computer science , payment , data mining , profit (economics) , mistake , credit risk , software , field (mathematics) , machine learning , artificial intelligence , actuarial science , support vector machine , business , mathematics , world wide web , programming language , political science , law , economics , pure mathematics , microeconomics
Leasing vehicles are a company engaged in the field of vehicle loans. Purchase by way of credit becomes a mainstay because it can attract potential customers to generate more profit. But if there is a mistake in approving a customer candidate, the risk of stalled credit payments can happen. To minimize the risk, it can be applied the certain data mining technique to predict the future behavior of the customers. In this study, it is explored in some data mining techniques such as C4.5 and Naive Bayes for this purpose. The customer attributes used in this study are: salary, age, marital status, other installments and worthiness. The experiments are performed by using the Weka software. Based on evaluation criteria, i.e. accuracy, C4.5 algorithm outperforms compared to Naive Bayes. The percentage split experiment scenarios provide the precision value of 89.16% and the accuracy value of 83.33% wheres the cross validation experiment scenarios give the higher accuracy values of all used k-fold. The C4.5 experiment results also confirm that the most influential instant data attribute in this research is the salary.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here