Average linkage
Topic of Hierarchical clustering and kernel density estimation, part of Statistical learning
Average linkage
| Type | Topic |
| Taught in | Hierarchical clustering and kernel density estimation |
| Part | Statistical learning |
| Questions using it | 1 |
In hierarchical clustering, the dissimilarity between two clusters is the average of all dissimilarities between a member of one and a member of the other, d_A(D_1,D_2)=\frac{1}{|D_1||D_2|}\sum_{x\in D_1}\sum_{y\in D_2}d(x,y). It is a compromise between single and complete linkage.
In Hierarchical clustering and kernel density estimation
Average linkage, in the group-average sense, takes the mean of all cross pairs,
d_A(D_1,D_2)=\frac{1}{|D_1|\,|D_2|}\sum_{x\in D_1}\sum_{y\in D_2}d(x,y),
where |\cdot| is the cardinality of the multiset. Clusters are allowed to be multisets so that duplicate points are legal.
Used in
- Taught in Hierarchical clustering and kernel density estimation
- Questions that use it (1) — Linkage by hand
- All 6 questions on Hierarchical clustering and kernel density estimation
See also
Hierarchical clustering · Complete linkage · Single, complete, and average linkage · Kernel density estimator · Agglomerative and divisive clustering · Properties of the linkages · Divisive clustering · Kernel density estimation