https://github.com/parvvaresh/k-means-clustering-algorithm-from-scratch-in-python
K-means clustering is a type of unsupervised learning, which is used when you have unlabeled data (i.e., data without defined categories or groups). The goal of this algorithm is to find groups in the data, with the number of groups represented by the variable K. The algorithm works iteratively to assign each data point to one of K groups based on
https://github.com/parvvaresh/k-means-clustering-algorithm-from-scratch-in-python
jupyter-notebook machine-learning numpy python
Last synced: 7 months ago
JSON representation
K-means clustering is a type of unsupervised learning, which is used when you have unlabeled data (i.e., data without defined categories or groups). The goal of this algorithm is to find groups in the data, with the number of groups represented by the variable K. The algorithm works iteratively to assign each data point to one of K groups based on
- Host: GitHub
- URL: https://github.com/parvvaresh/k-means-clustering-algorithm-from-scratch-in-python
- Owner: parvvaresh
- Created: 2023-02-26T17:05:16.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2023-02-26T18:41:41.000Z (almost 3 years ago)
- Last Synced: 2023-03-16T05:20:34.560Z (almost 3 years ago)
- Topics: jupyter-notebook, machine-learning, numpy, python
- Language: Jupyter Notebook
- Homepage:
- Size: 16.6 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0