Home | Trees | Indices | Help |
|
---|
|
api.ClusterI --+ | util.VectorSpace --+ | GroupAverageAgglomerative
The GAAC clusterer starts with each of the N vectors as singleton clusters. It then iteratively merges pairs of clusters which have the closest centroids. This continues until there is only one cluster. The order of merges gives rise to a dendogram: a tree with the earlier merges lower than later merges. The membership of a given number of clusters c, 1 <= c <= N, can be found by cutting the dendogram at depth c.
This clusterer uses the cosine similarity metric only, which allows for efficient speed-up in the clustering process.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Dendogram |
|
||
|
|||
|
|||
|
|||
Inherited from Inherited from Inherited from |
|
|
|
Finds the clusters using the given set of vectors.
|
Returns the index of the appropriate cluster for the vector.
|
|
Returns the number of clusters.
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0beta1 on Wed Aug 27 15:08:52 2008 | http://epydoc.sourceforge.net |