201 views

1 Answer

0 0 votes
good way is elbow method.
If we keep on increasing $k$, distortion will be keep on decreasing.
Answer:
Position:
Show:

Related questions

0 0 votes
1 1 answer
185
185 views
GO Classes asked Apr 1, 2025
185 views
$K$-means algorithm always finds the clustering $\left(C_1, \ldots, C_K\right)$ that minimizes the objective:Minimize $\sum_{k=1}^K \sum_{t \in C_j}\left\|x_t-r_j\right\|...
0 0 votes
1 1 answer
156
156 views
GO Classes asked Apr 1, 2025
156 views
Amazing, Inc. plans to open $k=2$ stores in Megacity and has $n=4$ customers located at positions $x^{(i)}$ as shown by circles in the plot below. The initial guesses for...
0 0 votes
1 1 answer
260
260 views
GO Classes asked Apr 1, 2025
260 views
Perform the K-Medoid algorithm for $\mathrm{K}=2$ on the given dataset, assuming that points D and E are chosen as the initial medoid centers.
0 0 votes
0 0 answers
170
170 views
GO Classes asked Apr 1, 2025
170 views
$\text { In which of the following plots are the points clustered by } k \text {-means clustering ? }$abboth a and bNeither a nor b