An open API service providing repository metadata for many open source software ecosystems.

Topic: "wcss"

ArtichaTM/CS2_WCSSkills

WCSSkills plugin for CS2

Language: C++ - Size: 2.82 MB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 2 - Forks: 0

vaitybharati/Assignment-08-PCA-Data-Mining-Wine-

Assignment-08-PCA-Data-Mining-Wine data. Perform Principal component analysis and perform clustering using first 3 principal component scores (both heirarchial and k mean clustering(scree plot or elbow curve) and obtain optimum number of clusters and check whether we have obtained same number of clusters with the original data (class column we have ignored at the begining who shows it has 3 clusters)

Language: Jupyter Notebook - Size: 94.7 KB - Last synced at: over 1 year ago - Pushed at: almost 4 years ago - Stars: 2 - Forks: 3

vaitybharati/P30.-Unsupervised-ML---K-Means-Clustering-Non-Hierarchical-Clustering-Univ.-

Unsupervised-ML---K-Means-Clustering-Non-Hierarchical-Clustering-Univ. Use Elbow Graph to find optimum number of clusters (K value) from K values range. The K-means algorithm aims to choose centroids that minimise the inertia, or within-cluster sum-of-squares criterion WCSS. Plot K values range vs WCSS to get Elbow graph for choosing K (no. of clusters)

Language: Jupyter Notebook - Size: 72.3 KB - Last synced at: over 1 year ago - Pushed at: almost 4 years ago - Stars: 1 - Forks: 0

vaitybharati/Assignment-07-K-Means-Clustering-Airlines-

Assignment-07-K-Means-Clustering-Airlines. Perform clustering (K means clustering) for the airlines data to obtain optimum number of clusters. Draw the inferences from the clusters obtained. The file EastWestAirlinescontains information on passengers who belong to an airline’s frequent flier program. For each passenger the data include information on their mileage history and on different ways they accrued or spent miles in the last year. The goal is to try to identify clusters of passengers that have similar characteristics for the purpose of targeting different segments for different types of mileage offers.

Language: Jupyter Notebook - Size: 90.8 KB - Last synced at: over 1 year ago - Pushed at: almost 4 years ago - Stars: 1 - Forks: 1

anastasius21/CustomerSegmentation

Customer Segmentation Model using KMeans Clustering

Language: Jupyter Notebook - Size: 71.3 KB - Last synced at: 10 days ago - Pushed at: 12 days ago - Stars: 0 - Forks: 0

Ansh2709/Customer-Segmentation-ML-Project

Project segregates the customers on the basis of their spending score and annual income using K-Means Clustering that is a part of unsupervised learning

Language: Jupyter Notebook - Size: 45.9 KB - Last synced at: about 1 month ago - Pushed at: 2 months ago - Stars: 0 - Forks: 0

srishtigaikwad/amazon-user-segmentation

Language: Jupyter Notebook - Size: 40 KB - Last synced at: 3 months ago - Pushed at: 3 months ago - Stars: 0 - Forks: 0

Anubhavkumar31/customer-segmenation-using-k-means-clustering

its a machine learning model which segments the customers using k-means clustering, the optimal number of clusters is find through WCSS.

Language: Python - Size: 3.91 KB - Last synced at: 2 months ago - Pushed at: 4 months ago - Stars: 0 - Forks: 0

Ninad077/Machine_Learning-K_means_clustering

Content: Unsupervised ML, Clustering, Customer Segmentation, WCSS, elbow method

Language: Jupyter Notebook - Size: 995 KB - Last synced at: 12 months ago - Pushed at: 12 months ago - Stars: 0 - Forks: 0

PatilSukanya/Assignment-08-PCA

Used libraries and functions as follows:

Language: Jupyter Notebook - Size: 104 KB - Last synced at: about 2 months ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

alfianhid/Starbucks-EDA-and-Customer-Segmentation-with-K-means-Algorithm

Language: Jupyter Notebook - Size: 55.4 MB - Last synced at: almost 2 years ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

RiteshopShrivastava/Hierarchical_Clustering

Unsupervised-ML---K-Means-Clustering-Non-Hierarchical-Clustering-Univ. Use Elbow Graph to find optimum number of clusters (K value) from K values range. The K-means algorithm aims to choose centroids that minimise the inertia, or within-cluster sum-of-squares criterion WCSS. Plot K values range vs WCSS to get Elbow graph for choosing K (no. of clusters)

Language: Jupyter Notebook - Size: 77.1 KB - Last synced at: over 1 year ago - Pushed at: over 3 years ago - Stars: 0 - Forks: 0

amangelbhullar/Clustering-Machine-Learning

k-Means Clustering

Size: 1000 Bytes - Last synced at: over 1 year ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 0

sumitkutty/Sparks-Foundation-Internship

The projects are a part of the internship by The Sparks Foundation

Language: Jupyter Notebook - Size: 1.25 MB - Last synced at: about 1 year ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 0