IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1711.05598.html
   My bibliography  Save this paper

Customer Selection Model with Grouping and Hierarchical Ranking Analysis

Author

Listed:
  • Bowen Cai

Abstract

The purpose of this study was to build a customer selection model based on 20 dimensions, including customer codes, total contribution, assets, deposit, profit, profit rate, trading volume, trading amount, turnover rate, order amount, withdraw amount, withdraw rate, process fee, process fee submitted, process fee retained, net process fee retained, interest revenue, interest return, exchange house return I and exchange house return II to group and rank customers. The traditional way to group customers in securities or futures companies is simply based on their assets. However, grouping customers with respect to only one dimension cannot give us a full picture about customers' attributions. It is hard to group customers' with similar attributions or values into one group if we just consider assets as the only grouping criterion. Nowadays, securities or futures companies usually group customers based on managers' experience with lack of quantitative analysis, which is not effective. Therefore, we use kmeans unsupervised learning methods to group customers with respect to significant dimensions so as to cluster customers with similar attributions together. Grouping is our first step. It is the horizontal analysis in customer study. The next step is customer ranking. It is the longitudinal analysis. It ranks customers by assigning each customer with a certain score given by our weighted customer value calculation formula. Therefore, by grouping and ranking customers, we can differentiate our customers and rank them based on values instead of blindly reaching everyone.

Suggested Citation

  • Bowen Cai, 2017. "Customer Selection Model with Grouping and Hierarchical Ranking Analysis," Papers 1711.05598, arXiv.org.
  • Handle: RePEc:arx:papers:1711.05598
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1711.05598
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:1711.05598. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.