From b18b8950a88e7f409df6bf4f38655b78de1c75b2 Mon Sep 17 00:00:00 2001 From: calcium9 <39865796+calcium9@users.noreply.github.com> Date: Tue, 4 Oct 2022 18:17:26 -0700 Subject: [PATCH] Fix typos in README fixed some small typos/formatting in the README --- 5_Clustering/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/5_Clustering/README.md b/5_Clustering/README.md index 56c19c1..78880b1 100644 --- a/5_Clustering/README.md +++ b/5_Clustering/README.md @@ -13,13 +13,13 @@ ### Introduction K-Means is an unsupervised machine learning algorithm. The algorithm divides the data points into k groups (called clusters), where each data point can belong to only one cluster. K-Means aims to group together similar data points into the same cluster, while keeping different clusters as far apart as possible. -Each cluster has a center, which is a data point that represents the center of the cluster. A data point gets added to a cluster whose center is closest to that data point. Distance between points is measures using sum of squared distances method. +Each cluster has a center, which is a data point that represents the center of the cluster. A data point gets added to a cluster whose center is closest to that data point. Distance between points is measured using sum of squared distances method. ### Algorithm 1. Select the number of clusters, k 2. Appoint k data points as cluster centers (either random assignment, or space them as far apart as possible) - 3. Until cluster assignments do not change, do the following for each data point: + 3. Until cluster assignments do not change, do the following for each data point: 1. Calculate the sum of squared distance between it and all the cluster centers. 2. Assign the point to the cluster having the closest center. 3. Recalculate the center for clusters by taking the average of all data points assigned to that cluster. @@ -31,4 +31,4 @@ Each cluster has a center, which is a data point that represents the center of t ## Hierarchical Clustering - Agglomerative Clustering -Initially, each data point is treated as an independent cluster. At each step, the two closest clusters are merged to become one cluster. This process continues until only a single cluster remains. Once the process is complete, we can cut the tree into clusters as needed. \ No newline at end of file +Initially, each data point is treated as an independent cluster. At each step, the two closest clusters are merged to become one cluster. This process continues until only a single cluster remains. Once the process is complete, we can cut the tree into clusters as needed.