In the first step of the k-means with the standard euclidean distance metric, the mean of the observation values are assigned to the cluster.
K-means clustering is one of the commonly used clustering algorithms for partitioning observations into a set of k groups. This method tries to classify observations into mutually exclusive groups, so that observations within the same cluster are as similar as possible.
In k-clustering, each cluster is represented by its centre which corresponds to the mean of the observation values assigned to the cluster.
This implies that k-algorithm recognizes the k number of centroids.
The following required of k-means clustering are defined distance metric, number of clusters, initial guess of centroids.
To know more about k-means algorithm:
https://brainly.com/question/17241662
#SPJ4