Scribd
Upload
13 views4 pages

ML Exp8

The document outlines an experiment focused on implementing the K-Means Clustering algorithm, an unsupervised learning technique used for clustering data. It explains the algorithm's functionality, including the selection of centroids and the iterative process of assigning data points to clusters. Additionally, it provides a step-by-step guide on how the K-Means algorithm operates and mentions the importance of determining the number of clusters (K) beforehand.

Uploaded by

Jui Sakpal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views4 pages

ML Exp8

The document outlines an experiment focused on implementing the K-Means Clustering algorithm, an unsupervised learning technique used for clustering data. It explains the algorithm's functionality, including the selection of centroids and the iterative process of assigning data points to clusters. Additionally, it provides a step-by-step guide on how the K-Means algorithm operates and mentions the importance of determining the number of clusters (K) beforehand.

Uploaded by

Jui Sakpal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

EXPERIMENT NO: 8

Name: Kadambari Dilip Bane


Class: AI/2
Roll No: 05

Aim: To implement machine learning algorithm (K-Means Clustering) Theory:

K-Means Clustering Algorithm:

K-Means Clustering is an unsupervised learning algorithm that is used to solve the clustering
problems in machine learning or data science. In this topic, we will learn what is K-means
clustering algorithm, how the algorithm works, along with the Python implementation of
kmeans clustering.

What is K-Means Algorithm?

K-Means Clustering is an Unsupervised Learning algorithm, which groups the clusters that need
to be created in the process, as if K=2, there will be two clusters, and for K=3, there will be
three clusters, and so on.

It allows us to cluster the data into different groups and a convenient way to discover the
categories of groups in the unlabeled dataset on its own without the need for any training.

It is a centroid-based algorithm, where each cluster is associated with a centroid. The main aim
of this algorithm is to minimize the sum of distances between the data point and their
corresponding clusters.

The algorithm takes the unlabeled dataset as input, divides the dataset into k-number of
clusters, and repeats the process until it does not find the best clusters. The value of k should
be predetermined in this algorithm.

The k-means clustering algorithm mainly performs two tasks:

o Determines the best value for K center points or centroids by an iterative process. o

Assigns each data point to its closest k-center. Those data points which are near to the

particular k-center, create a cluster.

The below diagram explains the working of the K-means Clustering Algorithm:
How does the K-Means Algorithm Work?

The working of the K-Means algorithm is explained in the below steps:

Step-1: Select the number K to decide the number of clusters.

Step-2: Select random K points or centroids. (It can be other from the input dataset).

Step-3: Assign each data point to their closest centroid, which will form the predefined K
clusters.

Step-4: Calculate the variance and place a new centroid of each cluster.

Step-5: Repeat the third steps, which means reassign each datapoint to the new closest
centroid of each cluster.

Step-6: If any reassignment occurs, then go to step-4 else go to FINISH.

Step-7: The model is ready.


CODE:
OUTPUT:

You might also like