BPNN, K-means, K-medoids
-
Updated
Jun 28, 2024 - Jupyter Notebook
BPNN, K-means, K-medoids
Final project of the International Master in Data Science in which our team develop marketing strategies for a fashion retail company targeted at specific customer segments and provide them with customized offers. The segmentation was done by employing RFM analysis in conjunction with unsupervised clustering algorithms.
Customer-Segmentation---Purchasing-Behavior
A comparative study of K-centroid clustering algorithms, including KMeans, CustomKMeans, Fermat-Weber KMedians, and Weiszfeld KMedians, highlighting their performance on separated and non-separated datasets.
Unsupervised machine learning
Clustered behavioral data into two groups, regardless of gender, and evaluated cluster consistency with gender division using silhouette and Davies-Bouldin scores. Additionally, identified the optimal cluster count using the elbow method and re-evaluated clustering efficacy.
Add a description, image, and links to the davies-bouldin-score topic page so that developers can more easily learn about it.
To associate your repository with the davies-bouldin-score topic, visit your repo's landing page and select "manage topics."