Clusters using a Single Link Technique Agglomerative Hierarchical Clustering by Dr. Mahesh Huddar

Clusters using a Single Link Technique Agglomerative Hierarchical Clustering in Machine Learning by Dr. Mahesh Huddar
Problem Definition:
For the given dataset find the clusters using a single link technique. Use Euclidean distance and draw the Dendrogram.
Kmeans Solved Example: • K Means Clustering Alg...
KMeans Algorithm: • KMeans Clustering Algo...
Solved Example Complete Linkage - Agglomerative Hierarchical Clustering: • Solved Example Complet...
Single Link Technique Agglomerative Hierarchical Clustering: • Clusters using a Singl...
********************************
1. Blog / Website: www.vtupulse.com/
2. Like Facebook Page: / vtupulse
3. Follow us on Instagram: / vtupulse
4. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates

Пікірлер: 45

  • @subhikshas4523
    @subhikshas45232 жыл бұрын

    Is distance between p3p4 0.16? why yor are putting as 0.13

  • @vivekiyer9482

    @vivekiyer9482

    Жыл бұрын

    Yes Even im getting 0.16

  • @swetha3749

    @swetha3749

    Жыл бұрын

    same even for distance(p4,p5) i got 0.28 but in the video its given as 0.23

  • @DesiCartoonsHindi

    @DesiCartoonsHindi

    8 ай бұрын

    same bhai... Bhosadika sala sab isme galat value dalke rakhe sale ne sab videos galat hai . MKC galat padha raha hai ekto kal exam hai

  • @Arf.78
    @Arf.785 ай бұрын

    thank you so much sir.... apki wjah se machine learning ka paper bhut acha huwa... love from Pakistan

  • @MaheshHuddar

    @MaheshHuddar

    5 ай бұрын

    Welcome Do like share and subscribe

  • @orhan4876
    @orhan48762 жыл бұрын

    Thank you!

  • @salqarni6682
    @salqarni66829 ай бұрын

    You are my hero. Thank you so much send you love from Saudi Arabia ❤️

  • @MaheshHuddar

    @MaheshHuddar

    8 ай бұрын

    Thank you too! Do like share and subscribe

  • @leamon9024
    @leamon90242 жыл бұрын

    Thanks sir. Does hierarchical clustering be able to do feature selection?

  • @leslieassabil2091
    @leslieassabil2091 Жыл бұрын

    Please do you have a video on complete linkage?

  • @pragyadaksh7718
    @pragyadaksh77186 ай бұрын

    What should be done if there is a tie when selecting the minimum distance?

  • @sneha.tiwari
    @sneha.tiwari Жыл бұрын

    Hello sir, I've one doubt, as in the first step, if we get minimum value at three places, then which two points will be chosen to form a cluster? For example, the min value is 2 and is between A,B and A,C and D,E Then in a first go, can we put ABC and DE as two cluster together?

  • @roboticsdesignforkidshyder3788
    @roboticsdesignforkidshyder37884 күн бұрын

    thank you

  • @sabertooth21
    @sabertooth212 жыл бұрын

    Thank You Sir..

  • @MaheshHuddar

    @MaheshHuddar

    2 жыл бұрын

    Welcome Do like share and subscribe

  • @techinfo89
    @techinfo892 жыл бұрын

    Excellent sir

  • @techinfo89

    @techinfo89

    2 жыл бұрын

    @@MaheshHuddar sir make a video on logistic regression

  • @rutikbodkeacademy1247
    @rutikbodkeacademy1247 Жыл бұрын

    Thank you sir ....make more on this topic

  • @MaheshHuddar

    @MaheshHuddar

    Жыл бұрын

    Welcome Do like share and subscribe

  • @_ANUSHKADIVEKAR
    @_ANUSHKADIVEKAR2 жыл бұрын

    thank you!

  • @MaheshHuddar

    @MaheshHuddar

    2 жыл бұрын

    Welcome Do like share and subscribe

  • @swasthikbhatt9833
    @swasthikbhatt9833 Жыл бұрын

    thank you sir

  • @MaheshHuddar

    @MaheshHuddar

    Жыл бұрын

    Welcome Do like share and subscribe

  • @sajanamethsarakulathunga243
    @sajanamethsarakulathunga243 Жыл бұрын

    Superb❤

  • @MaheshHuddar

    @MaheshHuddar

    Жыл бұрын

    Thank You Do like share and subscribe

  • @nuf4027
    @nuf4027 Жыл бұрын

    thanks

  • @MaheshHuddar

    @MaheshHuddar

    Жыл бұрын

    Welcome Do like share and subscribe

  • @raniaelrifai3337
    @raniaelrifai33375 ай бұрын

    May God’s peace, mercy, and blessings be upon you. May God bless you, Doctor. I would like to ask you about the Self Organization Map Algorithm (SOM) part. How it works. I followed how the algorithm works mathematically. And how it works through the NN interface. But I have several questions: 1 I want to teach Anural to find a technology group by assembling the parts in a specific group close to each other 2. So I have a matrix consisting of 4 rows and 7 columns. I arrange it according to the largest weight for each row, then calculate the weight for each column and arrange it according to the largest value of the weights obtained. 3. And so it continues until there is no change in the values of arranging the rows and columns accordingly, as there is no change. This method is known as order rank clustering. 4. I want to benefit from this SOM method, other than that this method takes the closest distance from the method of calculating the Euclidean distance and classifies it into one of the clusters in the new layer, and so on. I would like to discuss it with you, if you please. In order to solve the ambiguity, and delegate this method to accomplish the problem that I have, regards

  • @yogeshyewale478
    @yogeshyewale478 Жыл бұрын

    how to find distance between {p2,(p3,p6)} ?

  • @ahmadelhourani367

    @ahmadelhourani367

    Ай бұрын

    that depends on the type of link, for single link, you take the shortest distance from p2 either p2,p3 or p2,p6 as the distance between p2 and set of p3,p6

  • @statisticalmethodologies7938
    @statisticalmethodologies7938 Жыл бұрын

    Sir what formula did you use at 4:50 to merge P3 and P6 into a cluster (P3,P6) ?

  • @samogx86

    @samogx86

    Жыл бұрын

    In the matrix on the left, the minimum value is 0.10, so P3 merges with P6, the new cluster is (P3, P6) and since we are using Single Link we choose the minimum distance between distances P3, P1: 0.22 and P6, P1: 0.24

  • @evo-star7850

    @evo-star7850

    Жыл бұрын

    @@samogx86 According to your logic 5:35 while merging ( (P3,P6) , P4), ( ( (P3,P6) , P4) , P5) should contain 0.23. Can you explain why it's given 0.28?

  • @samogx86

    @samogx86

    Жыл бұрын

    @@evo-star7850 The new cluster is (P3,P6) , P4) and we need to find the shortest distance to P5, so we must choose between two distances given in the previous matrix: Distance (P3,P6) with P4: 0.37 or distance (P3,P6) with P5: 0.28. Now we know that shortest distance is 0.28.

  • @ganiyudurosinmi2547

    @ganiyudurosinmi2547

    Жыл бұрын

    @@evo-star7850 I think it is 28. I got 28 too not 23. It is square root of 0.0808

  • @megamithra6910
    @megamithra6910 Жыл бұрын

    🔥🔥👌

  • @MaheshHuddar

    @MaheshHuddar

    Жыл бұрын

    Thank You Do like share and subscribe

  • @BoyAlone16
    @BoyAlone16 Жыл бұрын

    Please sir what if for example the P1,P3 was the smallest distance can you explain which column am going to remove

  • @evo-star7850

    @evo-star7850

    Жыл бұрын

    P3 row and again P3 column(inverted L shape) will be removed and the lowest value of P1 and P3 will be written in new cluster P1,P3.

  • @rishuverma4513
    @rishuverma4513 Жыл бұрын

    What if P1 and P2 will be smallest 😶

  • @AnirrudhPrakhash
    @AnirrudhPrakhash Жыл бұрын

    7.50 distance between a point to the same point is zero.thats y we didn't take.

  • @user-nl5vz8uu4c
    @user-nl5vz8uu4c11 ай бұрын

    Superb teaching❤❤❤❤

  • @MaheshHuddar

    @MaheshHuddar

    11 ай бұрын

    Thanks and welcome Do like share and subscribe