Management Science Letters
|
|
|
- Christal Shelton
- 10 years ago
- Views:
Transcription
1 Management Science Letters 4 (2014) Contents lists available at GrowingScience Management Science Letters homepage: Measuring customer loyalty using an extended RFM and clustering technique Zohre Zalaghi * and Yousef Abbasnejad Varzi Department of Computer Science, International Kish Branch, Islamic Azad University, Kish, Iran C H R O N I C L E A B S T R A C T Article history: Received December 28, 2013 Accepted 24 March 2014 Available online March Keywords: Customer Life Time Customer Relationship Management RFM Model K-means Clustering Genetic Algorithm Today, the ability to identify the profitable customers, creating a long-term loyalty in them and expanding the existing relationships are considered as the key and competitive factors for a customer-oriented organization. The prerequisite for having such competitive factors is the presence of a very powerful customer relationship management (CRM). The accurate evaluation of customers profitability is considered as one of the fundamental reasons that lead to a successful customer relationship management. RFM is a method that scrutinizes three properties, namely recency, frequency and monetary for each customer and scores customers based on these properties. In this paper, a method is introduced that obtains the behavioral traits of customers using the extended RFM approach and having the information related to the customers of an organization; it then classifies the customers using the K-means algorithm and finally scores the customers in terms of their loyalty in each cluster. In the suggested approach, first the customers records will be clustered and then the RFM model items will be specified through selecting the effective properties on the customers loyalty rate using the multipurpose genetic algorithm. Next, they will be scored in each cluster based on the effect that they have on the loyalty rate. The influence rate each property has on loyalty is calculated using the Spearman s correlation coefficient Growing Science Ltd. All rights reserved. 1. Introduction Target customer selection has been one of the most important issues in customer-based marketing. Therefore, the basis of value making via the customers is to find profitable or potentially profitable customers (Hosseini et al., 2009; Cheng & Chen, 2009; Mak et al., 2011). Today, the ability to determine the profitable, loyal and long-term customers is the primary key success for customeroriented organizations. In order to achieve winning strategies, business owners must be looking for a suitable approach to detect the potential customers and attract them as much as possible. Many studies indicate that most organizations are aware of the role and importance of identifying customers who are valuable for the success of organization. Besides, the results are indicative of the fact that the strategies, which are based on locating and retaining appropriate customers will create significant *Corresponding author. Tel: addresses: [email protected] (Z. Zalaghi) 2014 Growing Science Ltd. All rights reserved. doi: /j.msl
2 906 value. Therefore, customers segmentation is considered as one of the primary approaches in marketing, which plays significant role in customer relationship management (CRM). CRM is defined the management skills in the organizational level obtained through a deep understanding, participating and managing the customers requirements and it is based on the knowledge obtained from the customers in the direction of increasing the organizational efficacy and productivity and consequently profitability. Today, utilization of the CRM strategies plays essential role as one of the main motives behind many efforts made by firms to create better value for their customers and have long-term revenue for them. The data extraction tool helps organizations necessary knowledge from customers data under a CRM framework (Golmah & Mirhashemi, 2012). The concept of customer lifetime (CLV) or loyalty is to measure customers loyalty in CRM (Chuang & Shen, 2008). CLV is the current value of all profits obtained from customers and it helps the decision makers target the appropriate markets, more effectively. Many researchers recommended numerous models for CLV calculation and utilization. One of the models used for discovering the rules dominant on the customer relationship is recency, frequency and magnitude (RFM) models. After the preliminary investigations on the previous studies on CRM, it was determined that no approach was suggested so far based on feature selection using the multi-objective genetic algorithm (MOGA) to evaluate the customer loyalty rate but no specific criterion was used in these approaches to weigh the attributes. In this paper, an approach is suggested, which specifies the attributes effective on the determination of the organization s customers loyalty rate using MOGA whose attributes form the RFM model. The influence rate of each attribute is calculated using the Spearman s correlation coefficient when determining the customers loyalty. This method can specify the loyal and disloyal customers with a good precision. 2. The work platform 2.1 The K-means clustering algorithm Clustering is a data-mining technique, which yields meaningful and informative clusters of objects with similar properties in an automatic mode (Garcia-Murillo & Annabi, 2002). In clustering, the primary objective is to form various groups with similar characteristics and the proposed study of this paper uses the K-means clustering. The purpose of executing K-means is to divide samples into k clusters and K prime centers will be selected randomly from the input data. Then the distance between each datum and each of the K centers are calculated and they are allocated to the cluster with the least distance with its center. After the allocation of all the points to the K centers, the mean of each cluster is calculated as the new center and the calculation of elements distance and their allocation are continued to new centers until there is no displacement in the clusters elements (Baradwaj & Pal, 2011). 2.2 The Spearsman s Correlation Coefficient The correlation coefficient is a statistical technique for determining the type and the degree of the relationship between a quantitative variable and another quantitative variable. The correlation coefficient is one of the criteria applied for determining the correlation of two variables. The correlation coefficient demonstrates the intensity and the type of relationship, which could direct or inverse. This coefficient is between 1 to -1, but in case there is no relationship between the two variables, it is The Genetic Algorithm The genetic algorithms implement the natural selection principles of Darwin to detect the optimal formula in order to forecast or match the patterns. In other words, it is a programming tool, which implements the genetic evolution as a pattern. The problem that should be solved is the input for the
3 Z. Zalaghi and Y. Abbasnejad Varzi / Management Science Letters 4 (2014) 907 algorithm and solutions will be encoded based on a pattern. In addition, the criterion called the propriety function evaluates each candid solution. In fact, the set of solutions for a problem will be selected randomly and form the primary population. In each level, some of these solutions will be chosen based on the propriety function and will produce the next generation. If this algorithm is designed properly, it will converge towards the optimal solution. One solution for the given problem is demonstrated via a list of parameters called chromosome or genome. Chromosomes are mainly shows as a single string of data. Of course, other types of data structures can also be applied. At first, different indices are generated for creating the first generation. Throughout each generation, each single specification is evaluated through the propriety function. To create the next generation, two genetic operators including chromosomes linkage and mutation are implemented. In the chromosomes linkage operator, two of the solutions from the population are chosen based on the propriety function and they are mixed together in order to generate new solutions or the offspring. In the operator, the offspring gene mutation are changed randomly, which leads the genetic algorithm not to get stuck in the local optimal (Baradwaj & Pal, 2011). The multipurpose genetic algorithm is similar to the genetic algorithm except that the objective is to optimize different purposes, simultaneously. One alternative for these multipurpose optimization solutions is to change them to a problem with one purpose. To so this, the purpose of the problem equals a combination of various primary solutions each of which is assigned a weight (Dias & De Vasconcelos, 2002). 2.4 The extended RFM model One of the models used for detecting the rules dominant on the customers relationships is the RFM models. The RFM models evaluate three properties for customers and score them based on the following properties, 1. Recency: the amount of time elapsed from the last transaction. Lower values indicate higher likelihood of customers repurchase. 2. Frequency: The number of transactions conducted in a specified time span. Higher values indicate higher possibility of customer loyalty. 3. Monetary: The more the price of this transaction, the more the organization s attention to it. According to Bult and Wansbeek (1995), the customer score in this model is calculated as follows, C = + + (1) j j j where C i is the customer j s score, C R is the recency property value, C F is the frequency property j value and finally C M is the value of the transaction price property for the customer j. In subsequent studies, the extended version of RFM is proposed. This model is called the weighed RFM model. In this approach, each RFM property is given a coefficient proportionate to its importance (Stone & Jacobs, 1988). In this approach, the following equation is used for calculating each customer s score: C = w + + (2) In this equation, w M, w F and w R represent the transaction price, the frequency property weight, and the recency property weight, respectively. There are also other ways proposed by considering other parameters such as RFM and WRFM. 3. Recent works Alvandi et al. (2012) introduced another approach that utilizes the WRFM method together with clustering. In the presented approach, besides the three properties, namely recency, frequency and
4 908 transaction price, the relationship time span is considered. The purpose of the relationship time span is the time interval between the first and the last transactions. This approach first clusters the customers and then it finds the error rate based on the distance each record. After clustering, the loyalty amount is calculated for each customer using the WRFM method and then the customers are classified into 16 groups. These groups specify the customers profitability rate. Danaee et al. (2013) considered an approach for classification and prioritization of the customers of a company using the concept of CLV and measuring the customers value and according to the importance of their needs. In this approach, the WRFM model and the K-means clustering algorithm are used, which means that first the R, F and M values are specified for each customer and then their weights (relative importance) are determined using analytical hierarch process (AHP) method (Saaty, 1988) and each customer s value is calculated based on the WRFM model. In the next level, the K- means clustering algorithm places the customers into 8 clusters according to their scores. Then the customers clusters are ranked based on their CLV. Finally, the obtained results along with the strategies that are to be applied by the company in various clusters are studied. Khajvand and Tarokh (2011) presented a model where the customers loyalty rate is calculated after studying their history in different periods and their behaviors in the future is estimated. This framework consists of 7 phases. First, it collects the required information in a six-season periods, then the collected data are divided based on the seasonal divisions and the RFM parameters are extracted for each customer and calculates clusters based on K-means and customer loyalty is calculated. Chan (2008) introduced a genetic algorithm (GA) for customers segmentation. In order to apply the genetic algorithm, first the data were converted into a string format of binary numbers called the chromosomes. In each generation, GA generated a new population using operators such as linkage and mutation. Finally, only those individuals with higher fitness can survive. In this algorithm, first the input data are converted into the binary strings. Second, the chromosomes are generated, randomly. Third, each chromosome is evaluated and individuals with higher fitness will be selected as the parents for the next generation. Fifth, the crossover is applied to produce new chromosomes. The mutation takes place in one bit, the new generation is generated. 4. The proposed method In this paper, a method is presented for evaluating the customers loyalty rate. For the suggested method, first the properties and attributes which are more important in identifying the profitable and loyal customers in an organization are selected using the GA and then the customers are scored using the extended RFM model in terms of their loyalty rate. The rate at which each attribute is allocated will be calculated when specifying the customers loyalty, using the Spearman s correlation coefficient. The suggested method can identify the loyal and disloyal customers with a good precision. Based on this, organizations will be able to take on various strategies based on the customers properties in order to find and keep the profitable customers in the future. In this paper, we have tried to select the attributes and properties, which are more important when specifying the customers loyalty rate in each cluster using the multipurpose GA after clustering the customers. Then we determined the customers loyalty rate based on the extended RFM model. The implementation phases of the suggested method are as follows: 1. Cluster the customers using the K-means clustering algorithm, 2. Calculate the Spearman s correlation coefficient for all properties, 3. Select the properties that are effective in determining the customers loyalty rate using the multipurpose genetic algorithm, 4. Calculate the customers score based on the extended RFM method. The Spearman correlation ratio is calculated according to Balaji and Srivatsa (2012) as follows,
5 = ( )( ) ( ) ( ) Z. Zalaghi and Y. Abbasnejad Varzi / Management Science Letters 4 (2014) 909 For each attribute (property), x, from the customers information set in the training set, there is a set of values. The attribute y is an attribute, which specifies whether the customer is loyal (1) or not (0). This way the correlation of each attribute is obtained with the customer s loyalty rate in each cluster. The chromosomes are considered equal to the set of attributes, i.e. each chromosome consists of 16 genes (attributes). If the attribute exists in the set of solutions, its corresponding value will be 1 and zero, otherwise. After creating the primary population, new generations will constantly be produced after the mutation and linkage operators are applied and will further be replaced by the previous generation. This process will continue until the solutions are converged towards the optimal solution. The purposes of the multipurpose genetic algorithm in the suggested method are: a) minimizing the number of attributes in the set and b) maximizing the set ability of prediction. Therefore, if we consider two purposes as one, we will have: = h h To determine the set prediction power, the Spearman s correlation coefficient is used. The prediction power equals the total of Spearman s correlation coefficients belonging to the attributes whose genes value equals 1. In order to calculate the customers score based on the extended RFM method, after selecting the properties, which are effective in determining the customers loyalty rate, the customers will be scored based on these properties. This score is indicative of the customer s life time. In this phase, each of the selected properties will be assigned a weight equal to the Spearman s correlation coefficient. The score of each customer is calculated as follows, (3) (2) = h (3) where W i is the weight of the i-th attribute (Spearman s correlation coefficient) and C i is the value of the i-th attribute. Obviously, higher scores indicate higher customer s life time. In order to evaluate the presented approach, the Bank Marketing Data Set [ is employed, which includes three properties, namely recency, frequency and monetary. After clustering, the customers records will be classified into four clusters. For each attribute, the Spearman s correlation coefficient is calculated per every four clusters. Then for each cluster, the attributes, which determine the customer s loyalty were selected. Based on the selected attributes in clusters, the scoring relations for customers were specified. In order to accurately assess the obtained relations, a set of records was employed as the examine set for each cluster. After clustering the records, each cluster is stored in a separate file. For each cluster, two third of the records were employed for the training set and the rest were used as the exam set. After the examining the suggested method with the records related to the exam set, the mean score pertinent to the loyal and disloyal customers are depicted for each cluster in Table 1 as follows, Table 1 The mean score of customers in each cluster Cluster The mean score of loyal customers The mean score of disloyal customers Now, in order to evaluate the obtained results, the two criteria, namely recall and precision were used as follows, = + (4)
6 910 = + (5) where T P represents the number of customers who were correctly realized as loyal, F n states the number of customers who were not correctly recognized as loyal and F P is associated with the number of customers who were incorrectly realized as loyal. As it is shown in Table 2, the suggested method identified the customers situation very well. This identification enables the related company and organization to identify those customers that bring no profit to the system and avoid much concentration on their requests and tastes. Table 2 Evaluation of the suggested method with the criteria recall and precision T P F P F n Precision recall Cluster Cluster Cluster Cluster In order to compare the performance of the proposed method, two methods presented by Liu and Shih (2005) were employed, namely WRFMCD and A-WRFMCD. In these methods that are applied on a hardware sale database, first the RFM values of each customer are normalized. Then they will be multiplied by their weights, which are calculated using the Pearson s correlation coefficient, and then the customers records will be clustered using the K-means algorithm, and applying the associative rules on the clusters, it extracts rules for presenting good suggestions to the customers. The two criteria, namely recall and precision are employed to evaluate these methods. Table 3 shows the values resulted from the above mentioned evaluations. Table 3 The evaluation results of the methods, namely WRFMCD and A-WRFMCD with the two criteria, namely precision and recall WRFMCD method A-WRFMCD method Top-N Precision Recall Top-N Precision Recall Top Top Top Top Top Top Top Top Top Top Top Top Top Top Top Top Fig. 1 and Fig. 2 compare the performance of the proposed model with WRFMCD and A-WRFMCD under the best and the worst mode. Fig. 1. A comparison of the recall value from the suggested method and that of the methods WRFMCD and A-WRFMCD Fig. 2. A comparison of the precision value from the suggested method and that of the methods WRFMCD and A-WRFMCD
7 Z. Zalaghi and Y. Abbasnejad Varzi / Management Science Letters 4 (2014) 911 As we can observe from Fig. 1 and Fig. 2, the suggested method in the customers classification provides good precision. In the worst mode, it outperformed the best mode compared with the other two methods. 6. Conclusion In this paper, a method was presented to determine the customers loyalty rate. This method first classified the customers based on their specifications in some clusters using the K-means clustering. Then it specified properties in each cluster, which help identifying the customers loyalty rate based on an extended WRFM method. To specify this property set, the multipurpose genetic algorithm was used. The purposes of this algorithm were defined as reducing the number of properties and increasing the prediction power. In order to evaluate the suggested method, a valid benchmarks were employed. The results obtained from the implementation have indicated of the high precision of the suggested method in identifying the condition of customers life time. To conduct more studies in this field, one can utilize more precise clustering algorithms. In addition, since many attributes do not play an important role in determining the customers loyalty, one can conduct a pre-process on the primary data and eliminate these attributes. After eliminating the attributes, applying the suggested method on the resulting database may provide better result. References Alvandi, M., Fazli, S., & Abdoli, F. S. (2012). K-Mean clustering method for analysis customer lifetime value with LRFM relationship model in banking services. International Research Journal of Applied and Basic Sciences, 3(11), Balaji, S., & Srivatsa S. K. (2012). Customer segmentation for decision support using clustering and association rule based approaches. International Journal of Computer Science and Engineering Technology, 3(11), Baradwaj, B. K., & Pal, S. (2011). Mining Educational Data to Analyze Students' Performance. International Journal of Advanced Computer Science & Applications, 2(6), Bult, J. R., & Wansbeek, T. (1995). Optimal selection for direct mail. Marketing Science, 14(4), Chan, C. C. H. (2008). Intelligent value-based customer segmentation method for campaign management: A case study of automobile retailer. Expert Systems with Applications, 34(4), Cheng, C. H., & Chen, Y. S. (2009). Classifying the segmentation of customer value via RFM model and RS theory. Expert Systems with Applications, 36(3), Chuang, H. M., & Shen, C. C. (2008, July). A study on the applications of data mining techniques to enhance customer lifetime value based on the department store industry. In Machine Learning and Cybernetics, 2008 International Conference on (Vol. 1, pp ). IEEE. Danaee, H., Aghaee, Z., Haghtalab, H., & Pour Salimi, M. (2013). Classifying and designing customer's strategy pyramid by customer life time value (CLV) (Case study: Shargh Cement Company). Journal of Basic Applied Science Resources, 3(7), Dias, A. H., & De Vasconcelos, J. A. (2002). Multiobjective genetic algorithms applied to solve optimization problems. Magnetics, IEEE Transactions on,38(2), Garcia-Murillo, M., & Annabi, H. (2002). Customer knowledge management.journal of the Operational Research society, 53(8), Golmah, V., & Mirhashemi, G. (2012). Implementing A Data Mining Solution To Customer Segmentation For Decayable Products-A Case Study For A Textile Firm. International Journal of Database Theory & Application, 5(3),
8 912 Hosseini, S. M. S., Maleki, A., & Gholamian, M. R. (2010). Cluster analysis using data mining approach to develop CRM methodology to assess the customer loyalty. Expert Systems with Applications, 37(7), Khajvand, M., Zolfaghar, K., Ashoori, S., & Alizadeh, S. (2011). Estimating customer lifetime value based on RFM analysis of customer purchase behavior: Case study. Procedia Computer Science, 3, Khajvand, M., & Tarokh, M. J. (2011). Estimating customer future value of different customer segments based on adapted RFM model in retail banking context. Procedia Computer Science, 3, Liu, D. R., & Shih, Y. Y. (2005). Hybrid approaches to product recommendation based on customer lifetime value and purchase preferences. Journal of Systems and Software, 77(2), Mak, M. K., Ho, G. T., & Ting, S. L. (2011). A Financial Data Mining Model for Extracting Customer Behavior. International Journal of Engineering Business Management, 3(3), Saaty, T. L. (1988). What is the analytic hierarchy process? (pp ). Springer Berlin Heidelberg. Stone, B., & Jacobs, R. (1988). Successful direct marketing methods. Lincolnwood, IL: NTC Business Books.
Product Recommendation Based on Customer Lifetime Value
2011 2nd International Conference on Networking and Information Technology IPCSIT vol.17 (2011) (2011) IACSIT Press, Singapore Product Recommendation Based on Customer Lifetime Value An Electronic Retailing
A Hybrid Model of Data Mining and MCDM Methods for Estimating Customer Lifetime Value. Malaysia
A Hybrid Model of Data Mining and MCDM Methods for Estimating Customer Lifetime Value Amir Hossein Azadnia a,*, Pezhman Ghadimi b, Mohammad Molani- Aghdam a a Department of Engineering, Ayatollah Amoli
Developing a model for measuring customer s loyalty and value with RFM technique and clustering algorithms
The Journal of Mathematics and Computer Science Available online at http://www.tjmcs.com The Journal of Mathematics and Computer Science Vol. 4 No.2 (2012) 172-181 Developing a model for measuring customer
Combining Data Mining and Group Decision Making in Retailer Segmentation Based on LRFMP Variables
International Journal of Industrial Engineering & Production Research September 2014, Volume 25, Number 3 pp. 197-206 pissn: 2008-4889 http://ijiepr.iust.ac.ir/ Combining Data Mining and Group Decision
Hybrid approaches to product recommendation based on customer lifetime value and purchase preferences
The Journal of Systems and Software 77 (2005) 181 191 www.elsevier.com/locate/jss Hybrid approaches to product recommendation based on customer lifetime value and purchase preferences Duen-Ren Liu a, *,
Implementing A Data Mining Solution To Customer Segmentation For Decayable Products A Case Study For A Textile Firm
Implementing A Data Mining Solution To Customer Segmentation For Decayable Products A Case Study For A Textile Firm Vahid Golmah and Golsa Mirhashemi Department of Computer Engineering, Islamic Azad University,
Cluster Analysis Using Data Mining Approach to Develop CRM Methodology
Cluster Analysis Using Data Mining Approach to Develop CRM Methodology Seyed Mohammad Seyed Hosseini, Anahita Maleki, Mohammad Reza Gholamian Industrial Engineering Department, Iran University of Science
Increasing Debit Card Utilization and Generating Revenue using SUPER Segments
Increasing Debit Card Utilization and Generating Revenue using SUPER Segments Credits- Suman Kumar Singh, Aditya Khandekar and Indranil Banerjee Business Analytics, Fiserv India 1. Abstract Debit card
Customer Relationship Management using Adaptive Resonance Theory
Customer Relationship Management using Adaptive Resonance Theory Manjari Anand M.Tech.Scholar Zubair Khan Associate Professor Ravi S. Shukla Associate Professor ABSTRACT CRM is a kind of implemented model
Numerical Research on Distributed Genetic Algorithm with Redundant
Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan [email protected],
GA as a Data Optimization Tool for Predictive Analytics
GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, [email protected]
ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
Mobile Phone APP Software Browsing Behavior using Clustering Analysis
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Mobile Phone APP Software Browsing Behavior using Clustering Analysis
Enhanced Boosted Trees Technique for Customer Churn Prediction Model
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 04, Issue 03 (March. 2014), V5 PP 41-45 www.iosrjen.org Enhanced Boosted Trees Technique for Customer Churn Prediction
Easily Identify Your Best Customers
IBM SPSS Statistics Easily Identify Your Best Customers Use IBM SPSS predictive analytics software to gain insight from your customer database Contents: 1 Introduction 2 Exploring customer data Where do
Data Mining Solutions for the Business Environment
Database Systems Journal vol. IV, no. 4/2013 21 Data Mining Solutions for the Business Environment Ruxandra PETRE University of Economic Studies, Bucharest, Romania [email protected] Over
K-Mean Clustering Method For Analysis Customer Lifetime Value With LRFM Relationship Model In Banking Services
International Research Journal of Applied and Basic Sciences 2012 Available online at www.irjabs.com ISSN 2251-838X / Vol, 3 (11): 2294-2302 Science Explorer Publications K-Mean Clustering Method For Analysis
Effect of some important factors on management of customer relationship with an emphasis on comprehensive banking
Effect of some important factors on management of customer relationship with an emphasis on comprehensive banking Department of management, Science and research branch, Islamic Azad University, Shahroud,
Customer Analytics. Turn Big Data into Big Value
Turn Big Data into Big Value All Your Data Integrated in Just One Place BIRT Analytics lets you capture the value of Big Data that speeds right by most enterprises. It analyzes massive volumes of data
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, [email protected]
Explode Six Direct Marketing Myths
White Paper Explode Six Direct Marketing Myths Maximize Campaign Effectiveness with Analytic Technology Table of contents Introduction: Achieve high-precision marketing with analytics... 2 Myth #1: Simple
A Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
Data Mining Techniques in CRM
Data Mining Techniques in CRM Inside Customer Segmentation Konstantinos Tsiptsis CRM 6- Customer Intelligence Expert, Athens, Greece Antonios Chorianopoulos Data Mining Expert, Athens, Greece WILEY A John
IT and CRM A basic CRM model Data source & gathering system Database system Data warehouse Information delivery system Information users
1 IT and CRM A basic CRM model Data source & gathering Database Data warehouse Information delivery Information users 2 IT and CRM Markets have always recognized the importance of gathering detailed data
Evolutionary SAT Solver (ESS)
Ninth LACCEI Latin American and Caribbean Conference (LACCEI 2011), Engineering for a Smart Planet, Innovation, Information Technology and Computational Tools for Sustainable Development, August 3-5, 2011,
RFM Analysis: The Key to Understanding Customer Buying Behavior
RFM Analysis: The Key to Understanding Customer Buying Behavior Can you identify your best customers? Do you know who your worst customers are? Do you know which customers you just lost, and which ones
IMPROVING THE CRM SYSTEM IN HEALTHCARE ORGANIZATION
IMPROVING THE CRM SYSTEM IN HEALTHCARE ORGANIZATION ALIREZA KHOSHRAFTAR 1, MOHAMMAD FARID ALVANSAZ YAZDI 2, OTHMAN IBRAHIM 3, MAHYAR AMINI 4, MEHRBAKHSH NILASHI 5, AIDA KHOSHRAFTAR 6, AMIR TALEBI 7 1,3,4,5,6,7
STATISTICA. Clustering Techniques. Case Study: Defining Clusters of Shopping Center Patrons. and
Clustering Techniques and STATISTICA Case Study: Defining Clusters of Shopping Center Patrons STATISTICA Solutions for Business Intelligence, Data Mining, Quality Control, and Web-based Analytics Table
Genetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic
Introduction To Genetic Algorithms
1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: [email protected] References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization
Easily Identify the Right Customers
PASW Direct Marketing 18 Specifications Easily Identify the Right Customers You want your marketing programs to be as profitable as possible, and gaining insight into the information contained in your
PROCESS OF LOAD BALANCING IN CLOUD COMPUTING USING GENETIC ALGORITHM
PROCESS OF LOAD BALANCING IN CLOUD COMPUTING USING GENETIC ALGORITHM Md. Shahjahan Kabir 1, Kh. Mohaimenul Kabir 2 and Dr. Rabiul Islam 3 1 Dept. of CSE, Dhaka International University, Dhaka, Bangladesh
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,
UNIVERSITY OF GHANA (All rights reserved) UGBS SECOND SEMESTER EXAMINATIONS: 2013/2014. BSc, MAY 2014
UNIVERSITY OF GHANA (All rights reserved) UGBS SECOND SEMESTER EXAMINATIONS: 2013/2014 BSc, MAY 2014 ECCM 302: CUSTOMER RELATIONSHIP MANAGEMENT (3 CREDITS) TIME ALLOWED: 3HRS IMPORTANT: 1. Please read
Life Insurance Customers segmentation using fuzzy clustering
Available online at www.worldscientificnews.com WSN 21 (2015) 38-49 EISSN 2392-2192 Life Insurance Customers segmentation using fuzzy clustering Gholamreza Jandaghi*, Hashem Moazzez, Zahra Moradpour Faculty
AUTO CLAIM FRAUD DETECTION USING MULTI CLASSIFIER SYSTEM
AUTO CLAIM FRAUD DETECTION USING MULTI CLASSIFIER SYSTEM ABSTRACT Luis Alexandre Rodrigues and Nizam Omar Department of Electrical Engineering, Mackenzie Presbiterian University, Brazil, São Paulo [email protected],[email protected]
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods
A STUDY ON DATA MINING INVESTIGATING ITS METHODS, APPROACHES AND APPLICATIONS
A STUDY ON DATA MINING INVESTIGATING ITS METHODS, APPROACHES AND APPLICATIONS Mrs. Jyoti Nawade 1, Dr. Balaji D 2, Mr. Pravin Nawade 3 1 Lecturer, JSPM S Bhivrabai Sawant Polytechnic, Pune (India) 2 Assistant
A New Approach in Software Cost Estimation with Hybrid of Bee Colony and Chaos Optimizations Algorithms
A New Approach in Software Cost Estimation with Hybrid of Bee Colony and Chaos Optimizations Algorithms Farhad Soleimanian Gharehchopogh 1 and Zahra Asheghi Dizaji 2 1 Department of Computer Engineering,
Social Media Mining. Data Mining Essentials
Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customers
Knowledge Discovery in Stock Market Data
Knowledge Discovery in Stock Market Data Alfred Ultsch and Hermann Locarek-Junge Abstract This work presents the results of a Data Mining and Knowledge Discovery approach on data from the stock markets
Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
Mining changes in customer behavior in retail marketing
Expert Systems with Applications 28 (2005) 773 781 www.elsevier.com/locate/eswa Mining changes in customer behavior in retail marketing Mu-Chen Chen a, *, Ai-Lun Chiu b, Hsu-Hwa Chang c a Department of
Banking Analytics Training Program
Training (BAT) is a set of courses and workshops developed by Cognitro Analytics team designed to assist banks in making smarter lending, marketing and credit decisions. Analyze Data, Discover Information,
A Review of Different Data Mining Techniques in Customer Segmentation
Journal of Advances in Computer Research Quarterly pissn: 2345-606x eissn: 2345-6078 Sari Branch, Islamic Azad University, Sari, I.R.Iran (Vol. 6, No. 3, August 2015), Pages: 51-63 www.jacr.iausari.ac.ir
Using Data Mining Techniques to Increase Efficiency of Customer Relationship Management Process
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5010-5015, 2012 ISSN: 2040-7467 Maxwell Scientific Organization, 2012 Submitted: February 22, 2012 Accepted: July 02, 2012 Published:
Use of Data Mining Techniques to Improve the Effectiveness of Sales and Marketing
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 4, April 2015,
Evaluation of performance and efficiency of the CRM
(Volume 5, Issue 1/ 2013 ), pp. 144 Evaluation of performance and efficiency of the CRM Renáta Miklenčičová 1, Bronislava Čapkovičová 2 1, 2 University of Cyril and Methodius in Trnava, Faculty of Mass
An evolutionary learning spam filter system
An evolutionary learning spam filter system Catalin Stoean 1, Ruxandra Gorunescu 2, Mike Preuss 3, D. Dumitrescu 4 1 University of Craiova, Romania, [email protected] 2 University of Craiova, Romania,
A Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
Journal of Information & Computational Science 9: 16 (2012) 4801 4809 Available at http://www.joics.com A Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
Managing Customer Retention
Customer Relationship Management - Managing Customer Retention CRM Seminar SS 04 Professor: Assistent: Handed in by: Dr. Andreas Meier Andreea Iona Eric Fehlmann Av. Général-Guisan 46 1700 Fribourg [email protected]
College of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************
ON INTEGRATING UNSUPERVISED AND SUPERVISED CLASSIFICATION FOR CREDIT RISK EVALUATION
ISSN 9 X INFORMATION TECHNOLOGY AND CONTROL, 00, Vol., No.A ON INTEGRATING UNSUPERVISED AND SUPERVISED CLASSIFICATION FOR CREDIT RISK EVALUATION Danuta Zakrzewska Institute of Computer Science, Technical
Comparison of K-means and Backpropagation Data Mining Algorithms
Comparison of K-means and Backpropagation Data Mining Algorithms Nitu Mathuriya, Dr. Ashish Bansal Abstract Data mining has got more and more mature as a field of basic research in computer science and
IBM SPSS Direct Marketing
IBM Software IBM SPSS Statistics 19 IBM SPSS Direct Marketing Understand your customers and improve marketing campaigns Highlights With IBM SPSS Direct Marketing, you can: Understand your customers in
Roulette Sampling for Cost-Sensitive Learning
Roulette Sampling for Cost-Sensitive Learning Victor S. Sheng and Charles X. Ling Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7 {ssheng,cling}@csd.uwo.ca
Marketing Advanced Analytics. Predicting customer churn. Whitepaper
Marketing Advanced Analytics Predicting customer churn Whitepaper Churn prediction The challenge of predicting customers churn It is between five and fifteen times more expensive for a company to gain
An Introduction to Data Mining
An Introduction to Intel Beijing [email protected] January 17, 2014 Outline 1 DW Overview What is Notable Application of Conference, Software and Applications Major Process in 2 Major Tasks in Detail
Evolutionary Detection of Rules for Text Categorization. Application to Spam Filtering
Advances in Intelligent Systems and Technologies Proceedings ECIT2004 - Third European Conference on Intelligent Systems and Technologies Iasi, Romania, July 21-23, 2004 Evolutionary Detection of Rules
Classify the Data of Bank Customers Using Data Mining and Clustering Techniques (Case Study: Sepah Bank Branches Tehran)
2015, TextRoad Publication ISSN: 2090-4274 Journal of Applied Environmental and Biological Sciences www.textroad.com Classify the Data of Bank Customers Using Data Mining and Clustering Techniques (Case
Management Science Letters
Management Science Letters 2 (2012) 1901 1906 Contents lists available at GrowingScience Management Science Letters homepage: www.growingscience.com/msl A study on the effect of knowledge on customer orientation
Data Mining Applications in Higher Education
Executive report Data Mining Applications in Higher Education Jing Luan, PhD Chief Planning and Research Officer, Cabrillo College Founder, Knowledge Discovery Laboratories Table of contents Introduction..............................................................2
Nine Common Types of Data Mining Techniques Used in Predictive Analytics
1 Nine Common Types of Data Mining Techniques Used in Predictive Analytics By Laura Patterson, President, VisionEdge Marketing Predictive analytics enable you to develop mathematical models to help better
A PANEL STUDY FOR THE INFLUENTIAL FACTORS OF THE ADOPTION OF CUSTOMER RELATIONSHIP MANAGEMENT SYSTEM
410 International Journal of Electronic Business Management, Vol. 4, No. 5, pp. 410-418 (2006) A PANEL STUDY FOR THE INFLUENTIAL FACTORS OF THE ADOPTION OF CUSTOMER RELATIONSHIP MANAGEMENT SYSTEM Jan-Yan
DATA MINING TECHNIQUES AND APPLICATIONS
DATA MINING TECHNIQUES AND APPLICATIONS Mrs. Bharati M. Ramageri, Lecturer Modern Institute of Information Technology and Research, Department of Computer Application, Yamunanagar, Nigdi Pune, Maharashtra,
A new Approach for Intrusion Detection in Computer Networks Using Data Mining Technique
A new Approach for Intrusion Detection in Computer Networks Using Data Mining Technique Aida Parbaleh 1, Dr. Heirsh Soltanpanah 2* 1 Department of Computer Engineering, Islamic Azad University, Sanandaj
BOOSTING - A METHOD FOR IMPROVING THE ACCURACY OF PREDICTIVE MODEL
The Fifth International Conference on e-learning (elearning-2014), 22-23 September 2014, Belgrade, Serbia BOOSTING - A METHOD FOR IMPROVING THE ACCURACY OF PREDICTIVE MODEL SNJEŽANA MILINKOVIĆ University
A Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0
212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order
Analytical hierarchy process for evaluation of general purpose lifters in the date palm service industry
Journal of Agricultural Technology 2011 Vol. 7(4): 923-930 Available online http://www.ijat-aatsea.com ISSN 1686-9141 Analytical hierarchy process for evaluation of general purpose lifters in the date
How To Solve The Kd Cup 2010 Challenge
A Lightweight Solution to the Educational Data Mining Challenge Kun Liu Yan Xing Faculty of Automation Guangdong University of Technology Guangzhou, 510090, China [email protected] [email protected]
Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
Customer Relationship Management
V. Kumar Werner Reinartz Customer Relationship Management Concept, Strategy, and Tools ^J Springer Part I CRM: Conceptual Foundation 1 Strategic Customer Relationship Management Today 3 1.1 Overview 3
Manjeet Kaur Bhullar, Kiranbir Kaur Department of CSE, GNDU, Amritsar, Punjab, India
Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Multiple Pheromone
Predictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization
182 IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.3, March 2010 Predictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization P.Radhakrishnan
A Constraint Guided Progressive Sequential Mining Waterfall Model for CRM
Journal of Computing and Information Technology - CIT 22, 2014, 1, 45 55 doi:10.2498/cit.1002134 45 A Constraint Guided Progressive Sequential Mining Waterfall Model for CRM Bhawna Mallick 1, Deepak Garg
Overview, Goals, & Introductions
Improving the Retail Experience with Predictive Analytics www.spss.com/perspectives Overview, Goals, & Introductions Goal: To present the Retail Business Maturity Model Equip you with a plan of attack
Enhancing Quality of Data using Data Mining Method
JOURNAL OF COMPUTING, VOLUME 2, ISSUE 9, SEPTEMBER 2, ISSN 25-967 WWW.JOURNALOFCOMPUTING.ORG 9 Enhancing Quality of Data using Data Mining Method Fatemeh Ghorbanpour A., Mir M. Pedram, Kambiz Badie, Mohammad
EVALUATION AND MEASUREMENT IN MARKETING: TRENDS AND CHALLENGES
EVALUATION AND MEASUREMENT IN MARKETING: TRENDS AND CHALLENGES Georgine Fogel, Salem International University INTRODUCTION Measurement, evaluation, and effectiveness have become increasingly important
Strategic Planning for the Textile and Clothing Supply Chain
, July 4-6, 2012, London, U.K. Strategic Planning for the Textile and Clothing Supply Chain Deedar Hussain, Manuel Figueiredo, Anabela Tereso, and Fernando Ferreira Abstract The expansion of textile and
MULTIPLE-OBJECTIVE DECISION MAKING TECHNIQUE Analytical Hierarchy Process
MULTIPLE-OBJECTIVE DECISION MAKING TECHNIQUE Analytical Hierarchy Process Business Intelligence and Decision Making Professor Jason Chen The analytical hierarchy process (AHP) is a systematic procedure
SOCIAL NETWORK ANALYSIS EVALUATING THE CUSTOMER S INFLUENCE FACTOR OVER BUSINESS EVENTS
SOCIAL NETWORK ANALYSIS EVALUATING THE CUSTOMER S INFLUENCE FACTOR OVER BUSINESS EVENTS Carlos Andre Reis Pinheiro 1 and Markus Helfert 2 1 School of Computing, Dublin City University, Dublin, Ireland
A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms
2009 International Conference on Adaptive and Intelligent Systems A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms Kazuhiro Matsui Dept. of Computer Science
Prediction of Stock Performance Using Analytical Techniques
136 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 5, NO. 2, MAY 2013 Prediction of Stock Performance Using Analytical Techniques Carol Hargreaves Institute of Systems Science National University
Segmentation of stock trading customers according to potential value
Expert Systems with Applications 27 (2004) 27 33 www.elsevier.com/locate/eswa Segmentation of stock trading customers according to potential value H.W. Shin a, *, S.Y. Sohn b a Samsung Economy Research
Comparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments
Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak
Subject Description Form
Subject Description Form Subject Code Subject Title COMP417 Data Warehousing and Data Mining Techniques in Business and Commerce Credit Value 3 Level 4 Pre-requisite / Co-requisite/ Exclusion Objectives
Using Data Mining for Mobile Communication Clustering and Characterization
Using Data Mining for Mobile Communication Clustering and Characterization A. Bascacov *, C. Cernazanu ** and M. Marcu ** * Lasting Software, Timisoara, Romania ** Politehnica University of Timisoara/Computer
A Service Revenue-oriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
Data Mining Algorithms and Techniques Research in CRM Systems
Data Mining Algorithms and Techniques Research in CRM Systems ADELA TUDOR, ADELA BARA, IULIANA BOTHA The Bucharest Academy of Economic Studies Bucharest ROMANIA {Adela_Lungu}@yahoo.com {Bara.Adela, Iuliana.Botha}@ie.ase.ro
COMBINING THE ANALYTICAL HIERARCHY PROCESS AND THE GENETIC ALGORITHM TO SOLVE THE TIMETABLE PROBLEM
COMBINING THE ANALYTICAL HIERARCHY PROCESS AND THE GENETIC ALGORITHM TO SOLVE THE TIMETABLE PROBLEM Ihab Sbeity, Mohamed Dbouk and Habib Kobeissi Department of Computer Sciences, Faculty of Sciences, Section
Constrained Classification of Large Imbalanced Data by Logistic Regression and Genetic Algorithm
Constrained Classification of Large Imbalanced Data by Logistic Regression and Genetic Algorithm Martin Hlosta, Rostislav Stríž, Jan Kupčík, Jaroslav Zendulka, and Tomáš Hruška A. Imbalanced Data Classification
E-commerce Transaction Anomaly Classification
E-commerce Transaction Anomaly Classification Minyong Lee [email protected] Seunghee Ham [email protected] Qiyi Jiang [email protected] I. INTRODUCTION Due to the increasing popularity of e-commerce
Business Intelligence Osvaldo Maysonet VP Marketing & Customer Knowledge Banco Popular
Business Intelligence Osvaldo Maysonet VP Marketing & Customer Knowledge Banco Popular Starting Questions How many of you have more information today and spend more time gathering and preparing the information
An Overview of Knowledge Discovery Database and Data mining Techniques
An Overview of Knowledge Discovery Database and Data mining Techniques Priyadharsini.C 1, Dr. Antony Selvadoss Thanamani 2 M.Phil, Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu,
