Це відео не доступне.
Перепрошуємо.
Complete Unsupervised Machine Learning Tutorials In Hindi- K Means,DBSCAN, Hierarchical Clustering
Вставка
- Опубліковано 15 сер 2024
- Unsupervised learning, also known as unsupervised machine learning, uses machine learning algorithms to analyze and cluster unlabeled datasets. These algorithms discover hidden patterns or data groupings without the need for human intervention. In thi video we will learn about k means clutering, dbscan clsutering, hierarichal clutering.
Timestamp:
00:00:00 Introduction To Unsupervised Machine Learning
00:07:22 K Means Clustering Indepth Intuition
00:31:59 Hierarichal Clustering Indepth Intuition
00:47:40 K Means vs Hierarichal Clutering
00:51:30 DBSCAN Clustering
01:02:22 Silhouette Score
01:10:05 K MEans Clusstering Implementation
01:24:09 Hierarichal Clustering Implementation
01:30:45 DBSCAN Clustering Implementation
-------------------------------------------------------------------------------------------------------------
All Playlist links are given below
NLP Playlist: • Natural Language Proce...
ML playlist in hindi: bit.ly/3NaEjJX
Stats Playlist In Hindi:bit.ly/3tw6k7d
Python Playlist In Hindi:bit.ly/3azScTI
---------------------------------------------------------------------------------------------------------------
Please donate if you want to support the channel through GPay UPID,
Gpay: krishnaik06@okicici
Telegram link: t.me/joinchat/...
-------------------------------------------------------------------------------------------------------------
Please join as a member in my channel to get additional benefits like materials in Data Science, live streaming for Members and many more
/ @krishnaik06
-----------------------------------------------------------------------------------------------------------
Please do subscribe my other channel too
/ @krishnaikhindi
---------------------------------------------------------------------------------------------------------
Connect with me here:
Twitter: / krishnaik06
Facebook: / krishnaik06
instagram: / krishnaik06
Dont Forget to subscribe the channel for more such videos :)
Hello Sir, I wanted some help on ONA, where or which course is available to learn ONA.
Sir please complete the staticial playlist
Sir i want to join pw 3500 rupees data science course,,,, but on ow app this course is not visible
sir please complete stat playlist😕
ai/bi how can it be small when ai is big . please don’t put wrong explanation. It misleads and create lot of confusion . I would request you to please go through it and confirm . As the understanding get completely twisted .
K-means++ techinque is used to avoid random initilization traps.Or in other words to intialize the centroids very far apart from each others so that all the data are grouped properly and classification becomes much accurate.
correction = 1:08:06
if bi> ai then only it is a good cluster
You are right.
Yes I got confused because of this line😅
yah bro , good point i got confused also
time --> 1:08 , if b(i) > a(i) then our cluster is good.
.
this playlist is Very Helpful...
Thanks Sir ❤❤❤❤❤❤❤
Fantastic explanation. No deviated talks, just the crux. Love the way you explain. Great going !!!
Time : 1: 16 ---> when our centroid is located very nearly then our model can't able to make good cluster , to outcome this problem we use K-MEAN ++ Initialization --> after applying this our centroid located FAR from each other.
Thanks Sir 💓💓💓
As always, super crisp and dope explanations!
Hi Krish. Pls make share more transition stories 🥲
Also emphasize more on the hiring process. Many companies probably have live codings rounds . Pls throw more light on this 🙏🏻
Thank you for the awesome free content on clustering.
Thank you very much sir i am from non it background but get all the concept little bit the way you r teaching is superb
sir, aapka teaching style bhut jyada accha hai, mere doubts clear hotey hai aapki hi videos se. Is lectures k notes kha se le sir.
Thank you so much sir.
Dendrograms : A Dendrogram is a tree-like diagram used to visualize the relationship among clusters.
sir please make complete playlist for ml for college exam like arm and all other topics,Your way of teaching is excellent!!
Amazing video. Thank you for teaching us with dedication.
Hello Mr Krish,
I believe you made a mistake in the silhoutte score section. If a(i) >>> b(i) this would mean that the intra cluster distance is greater than the inter cluster distance, which would further imply that the clustering that is done is poor. In the video you have taken that as a case of good clustering. Same is true for a(i)
sir ur amazing..!!!!
Great wok you are doing Krish, Please tell me about the Whiteboard app that you use, it will be a great help
Sir At 38:23, you have said that agglomerative is top down but its bottom up, and similarly divisible is top down.
Sir thank you for the informative sessions.
Sir please complete statistics playlist in Hindi
k means for large dataset and hierarchial for small dataset
By using k-means ++ we can initialise centroids which are far from each other, so that we can overcome Random Initialisation Trap.
Sir , please share the board PDP as you shared in the playlist of ML , it will very helpful for us
Hello Krish, if possible can you record some sessions around HM Markov model and Expectation-maximization algo?
sir when will end to end data science projects come with dvc and mlops included in that i really need it sir if possible please bring it as soon as possible
It is very helpful to understand unsupervised learning methods
Sir kindly provide lecture of ANN also
Hy i am unable to get ppt or notes of the classes.
score=silhouette_score(x_train,labels=kmeans.labels_)
this line throws an error. Please guide
Can you please share the whiteboard you use
Please yellow color use kare in compare of red
Hard hai
Stay hard
yeh slides github par upload kiya hai kya?.
Can I get this notepad pdf???
how do you define small and large dataset ?
@krishnaikhindi please help me understand
notes of last few videos is missing
for K=3 , how perpendicular lines will divide the clusters..there will be 6 clusters right..
no bro when dividing it will be like one-vs-all method, i.e consider 1st k value , one side will belonging the cluster of this point and the either is side will belong to the other groups
But how to find min pts value..?
seriously Bhai !!!!!! Esse bande padhye to padhne mai maaja aata hai...... saale clg ke gvr teachers , female faculty
se baate krne mai hi time waste krte hai....
Sir django p playlist bnao
mistake: a(i) < b(i) , good cluster, but it is said opposite in video timestamp(1:05:00)