Scribd
Upload
2 views23 pages

K-Means ML

Clustering is a data mining method that groups similar data elements into subclasses, also known as data segmentation. The quality of clustering depends on the chosen algorithm, with various methods like the K-means partitioning method, which iteratively assigns data points to clusters based on proximity to centroids. The K-means algorithm involves selecting the number of clusters, initializing centroids, and repeatedly assigning data points to the nearest centroid until no changes occur.

Uploaded by

ayusssssh100
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
2 views23 pages

K-Means ML

Clustering is a data mining method that groups similar data elements into subclasses, also known as data segmentation. The quality of clustering depends on the chosen algorithm, with various methods like the K-means partitioning method, which iteratively assigns data points to clusters based on proximity to centroids. The K-means algorithm involves selecting the number of clusters, initializing centroids, and repeatedly assigning data points to the nearest centroid until no changes occur.

Uploaded by

ayusssssh100
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/ 23

Clustering algorithms and cluster

analysis
CLUSTERING

• This is a data mining method used to place data elements in


their similar groups.

• Cluster is the procedure of dividing data objects into subclasses.

• Clustering quality depends on the way that we used.

• Clustering is also called data segmentation as large data groups


are divided by their similarity.
CLUSTERING

• Clustering is the grouping of specific objects based on their


characteristics and their similarities.

• As for data mining, this methodology divides the data that is


best suited to the desired analysis using a special join algorithm
.
CLUSTERING
There are 3 basic stages of clustering algorithm which are shown
below :
Clustering Algorithms in Data Mining
• Depending on the cluster models recently described, many clusters can
partition information into a data set.
• It should be said that each method has its own advantages and
disadvantages.
• The selection of an algorithm depends on the properties and the nature of
the data set.
Clustering Algorithms in Data Mining
The different methods of clustering in data mining are as explained below:
1. Partitioning based method
K means partitioning method
K means partitioning method

The algorithm takes the unlabelled 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:
•Determines the best value for K centre points or centroids by an iterative process.
•Assigns each data point to its closest k-center. Those data points which are near to the particular k-
center, create a cluster.
Hence each cluster has datapoints with some commonalities, and it is away from other clusters.
K means partitioning method
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.

You might also like