#24 Partitioning Clustering - K Means Algorithm |DM|

preview_player
Показать описание
Abroad Education Channel :

Company Specific HR Mock Interview :
A seasoned professional with over 18 years of experience with Product, IT Services and Agri industry of valuable experience in Human Resource Management, Extensive Experience in Talent Acquisition, Personnel Management, Compensation and Benefits, Performance Reviews, Training & Development and all facets of Human Resources will be performing mock HR Interviews and provides feedback on the session and guides with interview techniques.

paper presentation for semester exams :
Рекомендации по теме
Комментарии
Автор

last minute prep before 9hrs for sem... this is better than long lecture video

janarthanakrishnav
Автор

Having exam at 10am morning and me watching this video at 2.31 am midnight 😁

Gowtham_
Автор

Example from 5 min engineering..
Tq for more clear exaplantion mam

shaikkaif
Автор

Love u madam 😘😍 Tomorrow exam is data mining and big data for us ur videos make our exam easy for tomorrow❤

rahulsmarty
Автор

When the Euclidean distance of a new point is the same from both centroids k1 and k2 in a k-means clustering algorithm, the point is equidistant from both clusters. In this situation, the algorithm typically has a few possible ways to handle this tie:

1. Assign to a Random Cluster: The point can be assigned to either k1 or k2 randomly.

2. Assign to the Smaller Cluster: If one of the clusters has fewer points, the algorithm might assign the point to that cluster to help balance the sizes of the clusters.

3. Assign Based on Previous Iteration: If the point was part of one of the clusters in a previous iteration, it might be reassigned to the same cluster.

The choice among these strategies depends on the specific implementation of the k-means algorithm. In practice, the tie situation is rare, and the impact on the final clustering result is typically minimal.

aalok
Автор

idk if this algo is correct or not, but the output entirely depends upon the initial procedure . that's why i m little skeptical about the correctness as what if initally points are meant to be in same cluster

EscapeThirty
Автор

Mam I am obsessed with your hand writings 🥰

yadav
Автор

The value of X1 is 170 but u have mentioned that 70 plz check it mam

Satkeerthi_
Автор

please re check the video I feel there is some mistake said Y0 but added the value of Yc its a bit confusing

WhiteFang-oqdy
Автор

Is k means partition algorithm or k means algorithm same or different

met-saikumar
Автор

what should we do when k1 and k2 is equal

benazirfathima
Автор

Thank you so much❤
Your content is very helpful..
Could you please create a video on Gaussian mixture models

Butterfly_-mlif
Автор

can we take upto 5 numbers as example?

SyedMuzammil-wl
Автор

Please upload videos for k meloids ( PAM algorithm)🙏🙏

anjanavenkat
Автор

so here each and every time, should we have to divide it in 2 clusters??

RAAURANGABADKARROHAN
Автор

can the values of height and weight can we take reduced or particulary 12 ?

DevikaAlthi
Автор

What about pam(K- Medoids(Partitioning Around Medoid(PAM))

movielifelives
Автор

My exam today at 10 am and I'm seeing this vedio now 😂
Tq sis very use full vedio

moulimushini
Автор

Mam for example....oka set ki k1 and k2 find chedtunnappudu same values vaste.... Appudu aa particular set ni eh k1 lo place cheyaala leda k2 lo naaa

anusha
Автор

Madam Manam new centroids Akkadan use chayala

gopalmuthyala
visit shbcf.ru