• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1007-1018
• /
• 2008

The purpose of this case study is to demonstrate database-marketing management. First, we explore original variables for insurance customer's data, modify them if necessary, and go through variable selection process before analysis. Then, we develop churn prediction models using logistic regression, neural network and SVM analysis. We also compare these three data mining models in terms of misclassification rate.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.3
• /
• pp.111-118
• /
• 2007

What is CRM(Customer Relationship Management) means that planning, executing, and re-accessing the marketing strategy based on the customer character by analyzing the material related to customers. That is CRM is a strategy of customer service on the base of data. In the case of the telecommunications and a newspaper, there are restricted application of CRM, because they are provided services by paying a given amount of money within a given period of time. This paper develops CRM model(chum prediction model) that can apply to a newspaper. For model-building, real data were used which were collected from one of the major a newspaper company in Korea. Also, this paper verifies the efficient result.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.167-183
• /
• 2006

Since data mining attempts to find unknown facts or rules by dealing with also vaguely-known data sets, it always suffers from high error rate. In order to reduce the error rate, many researchers have employed multiple models in solving a problem. In this research, we present a new type of multiple models, called DyMoS, whose unique feature is that it classifies the input data and applies the different model developed appropriately for each class of data. In order to evaluate the performance of DyMoS, we applied it to a real customer churn problem of an automobile insurance company, The result shows that the DyMoS outperformed any model which employed only one data mining technique such as artificial neural network, decision tree and case-based reasoning.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.17-25
• /
• 2001

Tree model is the most popular classification algorithm in data mining due to easy interpretation of the result. In CART(Breiman et al., 1984) and C4.5(Quinlan, 1993) which are representative of tree algorithms, the split fur classification proceeds to attain the homogeneous terminal nodes with respect to the composition of levels in target variable. But, fur instance, in the chum prediction modeling fur CRM(Customer Relationship management), the rate of churn is generally very low although we are interested in mining the churners. Thus it is difficult to get accurate prediction modes using tree model based on the traditional split rule, such as mini or deviance. Buja and Lee(1999) introduced a new split rule, one-sided purity for classifying minor interesting group. In this paper, we compared one-sided purity with traditional split rule, deviance analyzing churning vs. non-churning data of ISP company. Also reviewing the result of tree model based on one-sided purity with some simulated data, we discussed problems and researchable topics.