00:01
Hello student here k -means clustering algorithm is given to us and first i want to tell the k -means clustering algorithm is an unsupervised learning algorithm.
00:11
Here we divide the ion observation into the k -cluster and in each cluster the data points are arranged in such a way such that they are very near to the centroids.
00:22
So in this way all the clusters are divided.
00:25
This is the way.
00:25
In here algorithm aim is to minimize the squared euclidean distance between observation and the center of the cluster to which it belongs.
00:35
So k -means algorithm is this in this way work.
00:39
So here according to the first question i have to select the best suitable answer.
00:43
So here i will go with k -means algorithm is about finding the mean of the cluster.
00:47
Yes and the algorithm is influenced by outlier.
00:50
Yes this statement is absolutely right.
00:53
So i will go with the option a.
00:55
Option a is very well described this.
00:58
Number second question is which is 21 question here.
01:03
I have to find out which statements represent these statements are most suitable for the k -means algorithm...