Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
$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 second iteration?
Solution
Cluster $C1$ contains the points
$(3,3),(5,5),(7,7)$
Centroid of $C1$ is
$\left(\dfrac{3+5+7}{3},\dfrac{3+5+7}{3}\right)$
$=(5,5)$
Now, Manhattan distance between $(4,4)$ and $(5,5)$ is
$|4-5|+|4-5|$
$=1+1$
$=2$
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
