IDEAS home Printed from https://ideas.repec.org/h/spr/advbcp/978-94-6463-098-5_37.html

The application of machine learning in the classification and classification of securities and futures customers

In: Proceedings of the 2022 4th International Conference on Economic Management and Cultural Industry (ICEMCI 2022)

Author

Listed:
  • Daniel Lu

    (University of San Francisco, Department of Economics)

Abstract

How to identify high-value customers among the massive customer base and achieve precise marketing and service is the current challenge facing securities and futures companies. The traditional method of dividing customer groups according to the amount of assets is more based on experience and not accurate enough. The goal of the research is to explore if machine learning algorithms can solve the above problem. In this study, a K-means clustering model is built to categorize individual customers into different groups based on their behavior. The Elbow method and Gap Statistics are used to determine 7 as the best number of clusters, and the corresponding K-means model is able to group customers in a more accurate way with regard to client total contribution to the firm’s revenue. Later, a gradient boost algorithm on a decision tree is developed to quantitatively score customers based on a weighted average of various dimensions. The 2 most important dimensions are net retained transaction fees and assets according to the model. These 2 models can help improve the accuracy of locating key customers compared to traditional methods.

Suggested Citation

  • Daniel Lu, 2023. "The application of machine learning in the classification and classification of securities and futures customers," Advances in Economics, Business and Management Research, in: Hrushikesh Mallick & Gaikar Vilas B. & Ong Tze San (ed.), Proceedings of the 2022 4th International Conference on Economic Management and Cultural Industry (ICEMCI 2022), pages 310-323, Springer.
  • Handle: RePEc:spr:advbcp:978-94-6463-098-5_37
    DOI: 10.2991/978-94-6463-098-5_37
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:advbcp:978-94-6463-098-5_37. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.