use the k- means algorithm to show only the three cluster centers after the first round of execution
Channel:
Subscribers:
108
Published on ● Video Link: https://www.youtube.com/watch?v=_kQaRy-IK2Q
2Suppose that the given data the taste is to cluster points (With (x.y)\nrepresenting location) into three cluster, where the points are.\nA1(2,10), A2(2,5), A3(8,4), B1 (5,8)\nB2(7,5) B3(6,4), C1(1,2), C2(4,9)\nThe distance function is Euclidean distance suppose initially we assign\nA1, B1 and C1 as the center of each cluster, respectively. use the k-\nmeans algorithm to show only the three cluster centers after the first\nround of execution with steps.
#dsbm #cluster #support
thankyou guys subscribe pls.... ❤️