Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged k-mean-clustering
1
votes
1
answer
1
UGC NET CSE | June 2019 | Part 2 | Question: 40
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? $2$ $\sqrt{2}$ $0$ $18$
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), ...
Arjun
3.5k
views
Arjun
asked
Jul 2, 2019
Others
ugcnetcse-june2019-paper2
k-mean-clustering
data-mining
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
