! * --K Means Algorithm-- * 1. Assign each observation to one of k groups * creating a random initial clustering * 2. Find the centroid of observations for each * cluster to form new centroids * 3. Find the centroid which is nearest for each * observation among the calculated centroids * 4. Assign the observation to its nearest centroid * to create a new clustering. * 5. R
source not stored for this graph (policy: none)
no test coverage detected