K Means Clustering, Hierarchical Clustering, Machine Learning, Dendrogram, Silhouette Score.
each iteration, we calculate the distance between each data point and the centroid. In this example, the k value is 1 and the distance value will always be greater than 0. We can then observe the graph and determine the K value where the WCSS starts to level off, indicating the optimal number of