Skip to content

This repo explains how to use KMeans classifier to create customer segmentation to help the marketing team of local supermarket in launching a campaign of new products

Notifications You must be signed in to change notification settings

faisal-irzal/customer_segmentation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Customer Segmentation using K-Means Clustering

Definition

k-means clustering is a method of vector quantization, that aims to partition data points / observations into distinct groups based on their similarity with each other. The number of distinct groups is determined by the value k. The similarity of each group is represented by means of the data points.

This method is part of the unsupervised learning which help us find meaningful insight from the unlabeled data. This method can be powerful for e.g. customer segmentation, where companies would like to get insights on customers shopping behaviour on their product.

Algorithm

The K-Means Clustering algorithm can be described as per below graph. Credit is given to https://data-science-infinity.teachable.com/

algorithm

This Notebook describes how to use the K-Means clustering method to calculate the supermarket customer segmentation. The results of this analysis will help the marketing team to tailor the marketing campaign of the new products to the customers' needs.

About

This repo explains how to use KMeans classifier to create customer segmentation to help the marketing team of local supermarket in launching a campaign of new products

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published