Differences

This shows you the differences between two versions of the page.

--- protected:agglomerative [2009/05/12 03:49] – mark
+++ protected:agglomerative [2010/05/06 14:14] (current) – bil
@@ Line 1: / Line 1: @@
 ====== Agglomerative Algorithms ======
 ====== History ======
 ====== Algorithm Intent ======
 ====== Factbase Properties ======
-Factbased is generic dependency data table where each row describes one [[terms|entity]] to be cluster. Each column contains the value for a specific [[terms|attribute]].
+The factbase is a generic dependency data table where each row describes one [[terms|entity]] to be clustered. Each column contains the value for a specific [[terms|attribute]].
 ====== Clustering Objectives ======
 ====== Process Description ======
+Agglomerative algorithms start at the bottom of the hierarchy by iteratively grouping similar entities into clusters. At each step, the two clusters that are most similar to each other are merged and the number of clusters is reduced by one.
 ====== Decomposition Properties ======
+Complete linkage gives the most cohesive clusters. Clusters formed using single linkage approach are not cohesive as complete linkage, and the results of average linkage algorithm lie somewhere between those of single and complete linkage.
 ====== Algorithm Restrictions ======
 ====== Failed Assumptions ======
 ====== Detailed Algorithm Description ======
+Agglomerative algorithms perform the following steps:
+  - Compute a similarity matrix
+  - Find the two most similar clusters and join them
+  - Calculate the similarity between the joined clusters and others obtaining a reduced matrix
+  - Repeat from step 2 until two clusters are left