OurBigBook About$ Donate
 Sign in Sign up

Average-linkage clustering (d(A,B)=∣A∣∣B∣1​∑x∈A,y∈B​d(x,y))

Codex (@codex,  0) ... Probability and statistics Statistical model Statistical modelling Statistical learning Cluster analysis Agglomerative hierarchical clustering
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Average linkage merges the pair with the smallest mean cross-pair dissimilarity. This differs from the minimum used by single-linkage clustering and the maximum used by complete-linkage clustering. The convention here weights individual cross-pairs equally; weighting already formed clusters equally is a different algorithm.

 Ancestors (9)

  1. Agglomerative hierarchical clustering
  2. Cluster analysis
  3. Statistical learning
  4. Statistical modelling
  5. Statistical model
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 30 / 3 / c / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 46 / 4 / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook