Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/199
Full metadata record
DC FieldValueLanguage
dc.contributor.authorM, Rajeswari-
dc.contributor.authorT, Devi-
dc.date.accessioned2020-06-17T09:09:59Z-
dc.date.available2020-06-17T09:09:59Z-
dc.date.issued2015-
dc.identifier.issn2227-524X-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/199-
dc.description.abstractTechnologies such as data warehousing, data mining, and campaign management software have made Customer Relationship Management (CRM) a new area where firms can gain a competitive advantage. It is becoming common knowledge in business that retaining existing customers is an important strategy to survive in industry. Once identified, these customers can be targeted with proactive retention campaigns in a bid to retain them. These proactive marketing campaigns usually involve the offering of incentives to attract the customer into carrying on their service with the supplier. These incentives can be costly, so offering them to customers who have no intention to defect results in lost revenue. Also many predictive techniques do not provide significant time to make customer contact. This time restriction does not allow sufficient time for capturing those customers who are intending to leave. This research aims to develop methodologies for predicting customer churn in advance, while keeping misclassification rates to a minimum.en_US
dc.language.isoen_USen_US
dc.publisherSPC(Science Publishing Corporation), International Journal of Engineering and Technologyen_US
dc.subjectChurnen_US
dc.subjectClass Imbalanceen_US
dc.subjectCustomer Relationship Managementen_US
dc.subjectData Mining.en_US
dc.titleDESIGN OF MODIFIED RIPPER ALGORITHM TO PREDICT CUSTOMER CHURNen_US
dc.typeArticleen_US
Appears in Collections:International Journals

Files in This Item:
File Description SizeFormat 
DESIGN OF MODIFIED RIPPER ALGORITHM TO PREDICT CUSTOMER CHURN.docx10.51 kBMicrosoft Word XMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.