Skip to content
#

elbow-method

Here are 109 public repositories matching this topic...

NLP-PROJECT-BOOK-INSIGHTS-WITH-PLOTLY

Plotly-Dash NLP project. Document similarity measure using Latent Dirichlet Allocation, principal component analysis and finally follow with KMeans clustering. Project is completed with dynamic visual interaction.

  • Updated Sep 8, 2022
  • Python

OptimalCluster is the Python implementation of various algorithms to find the optimal number of clusters. The algorithms include elbow, elbow-k_factor, silhouette, gap statistics, gap statistics with standard error, and gap statistics without log. Various types of visualizations are also supported.

  • Updated Nov 19, 2021
  • Python

Problem Statement: This data set is created only for the learning purpose of the customer segmentation concepts , also known as market basket analysis . I will demonstrate this by using unsupervised ML technique (KMeans Clustering Algorithm) in the simplest form.You are owing a supermarket mall and through membership cards , you have some basic data about your customers like Customer ID, age, gender, annual income and spending score. Problem Statement You own the mall and want to understand the customers like who can be easily converge [Target Customers] so that the sense can be given to marketing team and plan the strategy accordingly.

  • Updated May 25, 2020
  • Jupyter Notebook

This Repo Consists of some of the Tasks for The Sparks Foundation-Machine Learning and Data Science Internship, containing Supervised and Unsupervised Machine Learning Techniques to solve A ML Problem in a Systematic Way.

  • Updated Jul 19, 2020
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the elbow-method topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the elbow-method topic, visit your repo's landing page and select "manage topics."

Learn more