Question: Problem 3 K - Means, l distance. [ 1 0 pts ] Given the points over 3 - dimensional categorical data: ( 2 , 1

Problem 3K-Means, l distance. [10pts] Given the points over 3-dimensional categorical data:
(2,1,-1),(1,1,0),(3,-5,4)
(1,2,-1),(5,-1,2),(3,4,-5)
(6,5,-7),(1,2,5),(3,-2,3)
(1,1,2),(5,2,-4),(0,2,2)
(1,0,3),(4,3,-3),(2,-4,6)
You need to use l norm as the distance measure. The l-norm of a point x=(x1,x2,dots,xn)inRn is defined to be
||x||=maxi=1,2,dots,n|xi|
For example, the l-norm of (0,3,-4,1) is 4.
Consider clustering them in 3 clusters. The centroids are initialized at
c1=(1,0,4)
c2=(-1,0,4)
c2=(0,0,-3)
Problem 3 K - Means, l distance. [ 1 0 pts ]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!