K-means Clustering

O(n)? so relatively fast?
“K” needs to be determined.
Different result every time depending on initial points.

Mean-shift Clustering

Looks for cluster by using a sliding window and recalculating mean to be the new centroid and window (centroid based).
Some of the windows are removed in the post processing process.

No need to select “K”
“r” needs to be determined (rather hard)

Density-based Spatial Clustering of Application with Noise (DBSCAN)

???

GMM

???

Agglomeration Hierarchical Clustering

???

Reference

https://www.nextobe.com/single-post/2018/02/26/데이터-과학자가-알아야-할-5가지-클러스터링-알고리즘