Friday 22 November 2019

UGC NET PAPER 2 June 2019 Question 40 (Shift-I)

40. K-mean clustering algorithm has clustered the given 8 observations into 3 clusters after 1st 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 second iteration?
A) 2
B) √2
C) 0
D) 18
A
B
C
D
ANS. A

PreviousNext
UGC NET CS 2018 July - II Question 39UGC NET CS 2018 July - II Question 41

No comments:

Post a Comment

UGC NET Computer Science December 2019 | Question 16

Question 16 In a certain coding language. 'AEIOU' is written as 'TNHDZ'. Using the same coding language. 'BFJPV' wil...

Popular Posts