IDEAS home Printed from https://ideas.repec.org/a/ris/joibac/0046.html
   My bibliography  Save this article

Bootstrapping And Weighted Information Gain In Support Vector Machine For Customer Loyalty Prediction

Author

Listed:
  • Syukur, Abdul

    (Faculty of Computer Science, Universitas Dian Nuswantoro, Indonesia)

  • Wahono, Romi Satria

    (Faculty of Computer Science, Universitas Dian Nuswantoro, Indonesia)

  • Naufal, Abdul Razak

    (Faculty of Computer Science, Universitas Dian Nuswantoro, Indonesia)

  • Supriyanto, Catur

    (Faculty of Computer Science, Universitas Dian Nuswantoro, Indonesia)

Abstract

Prediction customer loyalty is an important business strategy for the modern telecommunications industry in the global competition. Support Vector Machine (SVM) is a classification algorithm that widely used to predict the customer loyalty. SVM in predicting customer loyalty has a weakness that affects the accuracy in the prediction. The problem is the difficulty of kernel function selection and determination of the parameter value. Large datasets may contain the imbalance class. In this study, bootstrapping method is used to overcome the imbalance class. In addition, datasets also contain some features that are not relevant to the prediction. In this study, we propose to use Forward Selection (FS) and Weighted Information Gain (WIG). FS eliminates the most irrelevant features and the computation time is relatively short compared to backward elimination and stepwise selection. WIG is used to weight the each attribute. In order to handle the selection of SVM parameters, we use a grid search method. Grid search method find the best parameter value by providing parameter value range. The experimental results from some combination of parameters can be concluded that the prediction of customer loyalty by using samples bootstrapping, FS-WIG and grid search is more accurate than the individual SVM.

Suggested Citation

  • Syukur, Abdul & Wahono, Romi Satria & Naufal, Abdul Razak & Supriyanto, Catur, 2018. "Bootstrapping And Weighted Information Gain In Support Vector Machine For Customer Loyalty Prediction," Journal of Internet Banking and Commerce, , vol. 23(01), pages 01-13, April.
  • Handle: RePEc:ris:joibac:0046
    as

    Download full text from publisher

    File URL: https://www.icommercecentral.com/open-access/bootstrapping-and-weighted-information-gain-in-support-vector-machine-for-customer-loyalty-prediction.php?aid=86672
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Customer Loyalty; Bootstrapping; Weighted Information Gain; Support Vector Machine;
    All these keywords.

    JEL classification:

    • A11 - General Economics and Teaching - - General Economics - - - Role of Economics; Role of Economists

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ris:joibac:0046. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Dale Pinto (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.