IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i12p7243-d837884.html
   My bibliography  Save this article

K-Means Clustering Approach for Intelligent Customer Segmentation Using Customer Purchase Behavior Data

Author

Listed:
  • Kayalvily Tabianan

    (Faculty of Information Technology, Inti International University, Persiaran Perdana BBN Putra Nilai, Nilai 71800, Malaysia)

  • Shubashini Velu

    (MIS Department, College of Business Faculty, Prince Mohammad bin Fahd University, Khobar 34754, Saudi Arabia)

  • Vinayakumar Ravi

    (Center for Artificial Intelligence, Prince Mohammad Bin Fahd University, Khobar 34754, Saudi Arabia)

Abstract

E-commerce system has become more popular and implemented in almost all business areas. E-commerce system is a platform for marketing and promoting the products to customer through online. Customer segmentation is known as a process of dividing the customers into groups which shares similar characteristics. The purpose of customer segmentation is to determine how to deal with customers in each category in order to increase the profit of each customer to the business. Segmenting the customers assist business to identify their profitable customer to satisfy their needs by optimizing the services and products. Therefore, customer segmentation helps E-commerce system to promote the right product to the right customer with the intention to increase profits. There are few types of customer segmentation factors which are demographic psychographic, behavioral, and geographic. In this study, customer behavioral factor has been focused. Therefore users will be analyzed using clustering algorithm in determining the purchase behavior of E-commerce system. The aim of clustering is to optimize the experimental similarity within the cluster and to maximize the dissimilarity in between clusters. In this study there are relationship between three clusters: event type, products, and categories. In this research, the proposed approach analyzed the groups that share similar criteria to help vendors to identify and focus on the high profitable segment to the least profitable segment. This type of analysis can play important role in improving the business. Grouping their customer according to their similar behavioral factor to sustain their customer for long-term and increase their business profit. It also enables high exposure of the e-offer to gain attention of potential customers. In order to process the collected data and segment the customers, an learning algorithm is used which is known as K-Means clustering. K-Means clustering is implemented to solve the clustering problems.

Suggested Citation

  • Kayalvily Tabianan & Shubashini Velu & Vinayakumar Ravi, 2022. "K-Means Clustering Approach for Intelligent Customer Segmentation Using Customer Purchase Behavior Data," Sustainability, MDPI, vol. 14(12), pages 1-15, June.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:12:p:7243-:d:837884
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/12/7243/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/12/7243/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yulin Deng & Qianying Gao, 2020. "RETRACTED ARTICLE: A study on e-commerce customer segmentation management based on improved K-means algorithm," Information Systems and e-Business Management, Springer, vol. 18(4), pages 497-510, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Laura Höpfl & Maximilian Grimlitza & Isabella Lang & Maria Wirzberger, 2024. "Promoting sustainable behavior: addressing user clusters through targeted incentives," Palgrave Communications, Palgrave Macmillan, vol. 11(1), pages 1-12, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:gam:jsusta:v:14:y:2022:i:12:p:7243-:d:837884. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.