edited by
3,487 views
1 votes
1 votes

K-mean clustering algorithm has clustered the given $8$ observations into $3$ clusters after $1$st iteration as follows:

$C1: \: \{(3,3), (5,5), (7,7) \}$

$C2: \: \{(0,6), (6,0), (3,0) \}$

$C3: \: \{(8,8), (4,4)\}$

What will be the Manhattan distance for observation $(4,4)$ from cluster centroid $C1$ in the second iteration?

  1. $2$
  2. $\sqrt{2}$
  3. $0$
  4. $18$
edited by

1 Answer

1 votes
1 votes

Correct option: (1) 2

The new position of cluster centroid $C_1$ after the $1^{st}$ iteration will be $(\frac{1}{3}(3+5+7), \frac{1}{3}(3+5+7)) = (5, 5)$

The Manhattan distance between $(4,4)$ and $(5,5)$ is $|4 -5| + |4 - 5| = 2$

Answer:

Related questions

0 votes
0 votes
0 answers
1
4 votes
4 votes
1 answer
2
1 votes
1 votes
1 answer
3
go_editor asked Jul 6, 2016
2,232 views
Match the following :$\begin{array}{clcl} \text{(i)} & \text{OLAP} & \text{(a)} & \text{Regression} \\ \text{(ii)} & \text{OLTP} & \text{(b)} & \text{Data Warehouse} \\ ...
1 votes
1 votes
1 answer
4
Arjun asked Jul 2, 2019
1,926 views
Hadoop (a big data tool) works with number of related tools. Choose from the following, the common tools included into Hadoop:MySQL, Google API and Map reduceMap reduce, ...