Clustering is a Machine Learning technique that involves the grouping of data points.

Given a
set of data points, we can use a clustering algorithm to classify each data point into a specific
group.

https://www.slideshare.net/rcapaldo/cluster-analysis-presentation?qid=55b9f57f-5e82-4da0-
b32d-c49973df7491&v=&b=&from_search=1

https://www.slideshare.net/gveress/cluster-training-2013?qid=55b9f57f-5e82-4da0-b32d-
c49973df7491&v=&b=&from_search=3
http://www2.cs.uregina.ca/~dbd/cs831/notes/clustering/clustering.html
1.k-mean clustering-

https://www.youtube.com/watch?v=KlWommpYHZ8

https://www.youtube.com/watch?v=mJ9fuaLtZSI

https://www.youtube.com/watch?v=YWgcKSa_2ag

2.k-medoid clustering

https://www.youtube.com/watch?v=AUriFHKw0TU

its patrioning alorithm

improve version of k-mean clustering

and least dissimilar object

K-Medoids is more robust as compared to K-Means. As in K-Medoids we find k as representative object

to minimize the sum of dissimilarities of data objects whereas, K-Means used sum of squared Euclidean
distances for data objects

3. Hierarchical Clustering in Non-Euclidean spaces

The sum of the distances to the other points in the cluster. The maximum distance to
another point in the cluster. The sum of the squares of the distances to the other points
in the cluster.

4.Agglomerative Hierarchical Clustering

https://www.datanovia.com/en/lessons/agglomerative-hierarchical-clustering/