Data Mining Thesis

Clustering

PCA (Pairwise Clustering Algorithm) – Hierarchical Agglomerative Method
1) Initially each color (data) is a cluster.
2) At each step we find the most similar pair of clusters. Merge these two clusters into one cluster.
The chosen pair is the one that corresponds to the minimal value achieved by the distance function. Its value has to be computed between all pairs.
3) Stop when obtain the desired number of colors.

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 )

Google+ photo

You are commenting using your Google+ 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