[Machine Learning] Clustering Algorithms

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)




Agglomeration Hierarchical Clustering




Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.