Scribd
Upload
0 views

Seminar

The document discusses the process of assigning data points to the nearest centroid in clustering, primarily using Euclidean distance. It explains the role of centroids as representative points of clusters and how they are calculated, as well as the objective function in k-means clustering, which aims to minimize the within-cluster sum of squares (SSE). The overall goal is to achieve tighter and more cohesive clusters by iteratively updating assignments and centroids.

Uploaded by

maddyrathod02
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0 views

Seminar

The document discusses the process of assigning data points to the nearest centroid in clustering, primarily using Euclidean distance. It explains the role of centroids as representative points of clusters and how they are calculated, as well as the objective function in k-means clustering, which aims to minimize the within-cluster sum of squares (SSE). The overall goal is to achieve tighter and more cohesive clusters by iteratively updating assignments and centroids.

Uploaded by

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

Assigning Points to

the Closest Centroid

By-
Varsha A- 4SF20CS172
• Assigns each data point to the nearest centroid.
• Assignment is based on a distance measure,
such as Euclidean distance.
Euclidean Distance, d(x,y)=
• Each data point is assigned to the cluster
represented by the nearest centroid.
Centroids and Objective
Functions
•In clustering, centroids are representative points that
act as the centers of clusters.

•For each cluster, there is a corresponding centroid


that represents the center of that cluster.

•Centroids are typically computed as the mean or


average of the data points within the cluster.

•The position of the centroids influences the


assignment of data points to clusters and the overall
clustering result.
Data in Euclidean
Spacealso known as a cost function or
• An objective function,
loss function, quantifies how well the clustering
algorithm performs.
• It provides a measure of the quality of the clusters or
the similarity of data points within each cluster.
• In k-means, the most common objective function is the
within-cluster sum of squares (WCSS) or the sum of
squared errors (SSE) also known as scatter
.
Centroid of the ith cluster is defined by:

• The goal of the k-means algorithm is to minimize


the SSE.

• By iteratively updating the assignments and


centroids, the algorithm aims to find the clustering
solution that minimizes the total squared distances
between data points and their assigned centroids.

• A lower SSE indicates tighter and more cohesive


clusters.
THANK YOU

You might also like