Home page

Unsupervised Learning: Introduction to K-mean Clustering




Video quality The size Download

Information Unsupervised Learning: Introduction to K-mean Clustering


Title :  Unsupervised Learning: Introduction to K-mean Clustering
Lasting :   15.17
Date of publication :  
Views :   228 rb


Frames Unsupervised Learning: Introduction to K-mean Clustering





Description Unsupervised Learning: Introduction to K-mean Clustering



Comments Unsupervised Learning: Introduction to K-mean Clustering



Beradinho Yilmaz
Hi mam is k means and kneighborhood algorithms are same ?
Comment from : Beradinho Yilmaz


Amir star
great job :)
Comment from : Amir star


Ongolo Abouna Roger Claude
Thank u
Comment from : Ongolo Abouna Roger Claude


CheekyGoose
Beautiful video, it just explains exactly what I was looking for Hopefully I get this question on my exam!
Comment from : CheekyGoose


Mah moud
Great Info Thanks a lot
Comment from : Mah moud


nanda gopal
nice video
Comment from : nanda gopal


Rahul Roy
Why am I watching this again? 😢brTnx though
Comment from : Rahul Roy


Adil Farooq
Excellent and easy explanation, thanks a billion Prof Mirzaei
Comment from : Adil Farooq


Panos Tzakis
Thanks really for helping us!!Excellent work!!
Comment from : Panos Tzakis


FREDERICK NII A OTU-AFRO
Awesome video! I can't believe how you simplified everything for it to make this much sense Kudos to you!
Comment from : FREDERICK NII A OTU-AFRO


Pixie
what if during euclidean distance computation, a point has the same distance to 2 clusters ?
Comment from : Pixie


Anurag Singh
Thank you 😊💓
Comment from : Anurag Singh


Tom Tsoumpas
Awesome video! Great explanation
Comment from : Tom Tsoumpas


Computational Notes
Excellent explanation
Comment from : Computational Notes


Rohit Singla
These teachers in college would be appreciated , not those boring professors
Comment from : Rohit Singla


ALEKHYA KOTARI
The way you explained was really awesome loved it ❤️ best video for kmeans clustering
Comment from : ALEKHYA KOTARI


Mohammad Aref Haidary
appreciate you
Comment from : Mohammad Aref Haidary


Nakhshiniev Bakhtiyor
The best way of K-mean Clustering explaination! Iranian Professor is amazingly good at teaching!
Comment from : Nakhshiniev Bakhtiyor


Harsh Alashi
Thanks for the tutorial
Comment from : Harsh Alashi


Muhammad Suhaib
Beautifully explained! Most simple and useful
Comment from : Muhammad Suhaib


hory channels
pls,what the reference u explain from it can u add it and thank u so much for helping videos
Comment from : hory channels


fuad khan
That was too much helpful Thank you very much To learn k-means, this tutorial is recommended
Comment from : fuad khan


Octo8
Thanks so much! I finally got it!
Comment from : Octo8


Laurent Sanou
I am sure this is the video everybody is looking for Underrated
Comment from : Laurent Sanou


Moin Uddin
Thank you!
Comment from : Moin Uddin


Morsalin Islam
মাশা আল্লাহ।
Comment from : Morsalin Islam


Bashaar
from where i can get the code of this question
Comment from : Bashaar


스펀지솜
you saved my day at last i can hand calculate the first step of centroid of clustering
Comment from : 스펀지솜


AOMO
Thank y so much Very helpful
Comment from : AOMO


Samran Khan Shaan
Thanks
Comment from : Samran Khan Shaan


Khabbaz Mohamed
Thank you very much
Comment from : Khabbaz Mohamed


Attique Shah
Another correction as well, br brCorrectoin: at 11:53, In cluster 1: /3 instead of /2 br brGreat explanation anyways
Comment from : Attique Shah


Michael
Thank you for this video God bless you
Comment from : Michael


Oumaima
Thank u so much miss 💓
Comment from : Oumaima


Umair Rehman
is this 2D clustering
Comment from : Umair Rehman


Reem Abdullah
Best video ever!!!!
Comment from : Reem Abdullah


Mudi Ovuede
this is an excellent explanation
Comment from : Mudi Ovuede


datletien
Thank you Prof Mirzaei, your lecture is amazing !
Comment from : datletien


Ajmal Ram
👍
Comment from : Ajmal Ram


Shreshth Kaushik
Really awesome video I understood this in one time You teach so better than my professor, wish you were my professor
Comment from : Shreshth Kaushik


OLUMIDE ADESINA
Good job Thank you
Comment from : OLUMIDE ADESINA


Yousra Chahinez HADJ AZZEM
Wonderful explanation!!!
Comment from : Yousra Chahinez HADJ AZZEM


Aneesha ks
Thank you so much ma'am
Comment from : Aneesha ks


Aniket Mukherjee
This was extremelyyyy helpful Thank you so much, your explanations were crystal clear
Comment from : Aniket Mukherjee


lakshminarayana kodavali
GOOD Explanaton Thank you for providing nice video
Comment from : lakshminarayana kodavali


R G
Mam can you please help to draw cluster in matlab I have a matrix of 10×10 but I am not able to draw cluster
Comment from : R G


Amira Amira

Comment from : Amira Amira


Rawush zafar
درود خدمت تان بانو شگوفه غزیز و گرامیthank you soo much dear Msshukofeh
Comment from : Rawush zafar


Chikezie Monalisa
Thank you so much for this Please, can you do a video on k-means cluster evaluation; Internal measure, hand calculated
Comment from : Chikezie Monalisa


Study With Osama Ali
I have been searching for this type of solution for 2 two days
Comment from : Study With Osama Ali


Rim Belkhir
Thank u🙏
Comment from : Rim Belkhir


Mateusz Mati
Could you please add k-means and DBSCAN with constraints?
Comment from : Mateusz Mati


Worajedt Sitthidumrong
Very concise and to the point May be the best explanation for this topic brOnly number and font in slides that wish it more readable But the lecture quality is master piece !
Comment from : Worajedt Sitthidumrong


DrSVasundhara
Very easily explained madam
Comment from : DrSVasundhara


Aziza Mirsaidova
Your explanation is so comprehensive and easy to understand Thank you for your time and effort that you put into making this tutorial
Comment from : Aziza Mirsaidova


Naman pratap Singh
Thanks ma'am
Comment from : Naman pratap Singh


Naman Pratap Singh
Thanks Ma'am
Comment from : Naman Pratap Singh


Muhammad Zeeshan
apki awaz me lan
Comment from : Muhammad Zeeshan


SHAHID IQBAL
Baji chaa gaey jey tusi You have done a fabulous job
Comment from : SHAHID IQBAL


Ayesha Rahman
Thank you so much Very easy and nice understanding skill 😊 very helpful vedio
Comment from : Ayesha Rahman


Shantanu Sharma
You did an amazing job explaining this visually I think most people get scared with Mathematical concepts and Algorithms is because they are visual, and if they can't see how it works practically and visually, they loose interest I wish I was taught this way in my school days Thank you
Comment from : Shantanu Sharma


Thomas
Amazingly explained, thanks!
Comment from : Thomas


Mehedi Hassan
Thank You Mam! ❤️ bryou helped me a lot
Comment from : Mehedi Hassan


I’m Da Dood
I had a one hour lecture Our lecturer just kept on reading the presentation slides And here, bam! I spend 15 minutes trying to understand I understood! Thank you, ma’am
Comment from : I’m Da Dood


lahiru
great explanation mam!!! It was really helpful to me Finally I solved my problem Thanks!
Comment from : lahiru


esy sss
بسیار عالی
Comment from : esy sss


Asad Ullah
hi may I ask why didn't you use Euclidean distance formula to calculate distance between the points?
Comment from : Asad Ullah


Hasan Badir
Thank so much!
Comment from : Hasan Badir


Aussie
thanks Shokoufeh joon, very helpful
Comment from : Aussie


Nermin Maslo
Thank you <3
Comment from : Nermin Maslo


Onyinyechi Chukwuma
Perfect! ;D
Comment from : Onyinyechi Chukwuma


Emerald Sika
you are really amazing
Comment from : Emerald Sika


Abhishek Ravoor
The BEST Explanation of K-Means Clustering Algorithm on YouTube
Comment from : Abhishek Ravoor


devansh messon
Thank you so much for this!
Comment from : devansh messon


SIRF DEKHO
How to find cluster
Comment from : SIRF DEKHO


Lewis Hoang Long
I understand this for the first time! Thank you so much!
Comment from : Lewis Hoang Long


Retro Future Style
The fact that we have to do this by hand is utterly ridiculous
Comment from : Retro Future Style


Ziad Salem
very clear explanation Thank you
Comment from : Ziad Salem


park jiji
thank u so muck , u're video is really helpfull
Comment from : park jiji


Oksana Fedan
Thanks a lot!!!
Comment from : Oksana Fedan


Amira Amira
Thank you so so soso much ❤
Comment from : Amira Amira


Obi
thanks so much for the explanation
Comment from : Obi


Sanni Afeez
Thanks a lot Your videos helped understanding it easily and made it less ambiguous as my professor made it seem
Comment from : Sanni Afeez


Khine Myat Thwe
this saved my life thanks
Comment from : Khine Myat Thwe


נימרוד לוי
good job
Comment from : נימרוד לוי


Sarah Kaur
honestly the best video i have come across to clearly explain this topic!
Comment from : Sarah Kaur


Tech Talks
Honestly, this is the only video that helped me to understand this topic
Comment from : Tech Talks


Md Yousuf
can i use Euclidean Distance instead of Rectilinear distance?
Comment from : Md Yousuf


Carlo_WR
Im strugling on our data mining subject since theres a pandemic and i cant attend online classes and can only rely on modules Modules cant really explain everything so im thankful that you explained this clearly
Comment from : Carlo_WR


Ammar Zorig
thank you sister
Comment from : Ammar Zorig


Wahhajat khan
can u tell memam y only euclidean distance here y nt any other distance metrics ??
Comment from : Wahhajat khan


SHABIH HASSAN JAN
This was great - Thank you so very much!
Comment from : SHABIH HASSAN JAN


BSL Nada
Thank youuu !!! The only video that made me really understand it !
Comment from : BSL Nada


Gebremichael Kibret Sheferaw
Your explanation is much excellent like your dutifulness Thanks
Comment from : Gebremichael Kibret Sheferaw


Sarıların Sülonun Dedesi
THANK YOU
Comment from : Sarıların Sülonun Dedesi



Related Unsupervised Learning: Introduction to K-mean Clustering videos

Three Clustering Algorithms You Should Know: k-means clustering, Spectral Clustering, and DBSCAN Three Clustering Algorithms You Should Know: k-means clustering, Spectral Clustering, and DBSCAN
РѕС‚ : Dr. Data Science
Download Full Episodes | The Most Watched videos of all time
#107: Scikit-learn 104:Unsupervised Learning 8: Intuition for Clustering #107: Scikit-learn 104:Unsupervised Learning 8: Intuition for Clustering
РѕС‚ : learndataa
Download Full Episodes | The Most Watched videos of all time
Sparse Coding and Dictionary Learning | Unsupervised Learning for Big Data Sparse Coding and Dictionary Learning | Unsupervised Learning for Big Data
РѕС‚ : Krishnaswamy Lab
Download Full Episodes | The Most Watched videos of all time
Supervised vs Unsupervised vs Reinforcement Learning | Machine Learning Tutorial | Simplilearn Supervised vs Unsupervised vs Reinforcement Learning | Machine Learning Tutorial | Simplilearn
РѕС‚ : Simplilearn
Download Full Episodes | The Most Watched videos of all time
6.2.7 An Introduction to Clustering - Video 4: Computing Distances 6.2.7 An Introduction to Clustering - Video 4: Computing Distances
РѕС‚ : MIT OpenCourseWare
Download Full Episodes | The Most Watched videos of all time
2. K-means Clustering: Types, Applications, and Distance Measures | Machine Learning Algorithms 2. K-means Clustering: Types, Applications, and Distance Measures | Machine Learning Algorithms
РѕС‚ : CodersArts
Download Full Episodes | The Most Watched videos of all time
Statistical Learning: 12.3 k means Clustering Statistical Learning: 12.3 k means Clustering
РѕС‚ : Stanford Online
Download Full Episodes | The Most Watched videos of all time
Visible Learning - what are effect sizes and what do they mean for learning? Visible Learning - what are effect sizes and what do they mean for learning?
РѕС‚ : Companion Websites
Download Full Episodes | The Most Watched videos of all time
StatQuest: K-means clustering StatQuest: K-means clustering
РѕС‚ : StatQuest with Josh Starmer
Download Full Episodes | The Most Watched videos of all time
Learnable Similarity Functions and Their Applications in Information Integration and Clustering Learnable Similarity Functions and Their Applications in Information Integration and Clustering
РѕС‚ : Microsoft Research
Download Full Episodes | The Most Watched videos of all time