Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Complete-linkage clustering

Machine Learning Algorithm

Complete-linkage clustering is one of several methods of agglomerative hierarchical clustering, also known as farthest neighbour clustering. Each element starts in its own cluster, and clusters are then combined step by step into larger clusters until every element belongs to a single cluster. The result can be visualized as a dendrogram showing the sequence in which clusters were fused and the distance at which each fusion occurred. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Time Complexity
Time Complexity (category)
Cubic Time -- O(n^3) 1
Connections

In Field

Source Wikipedia: Complete-linkage clustering
Sources
1. Wikipedia: Complete-linkage clustering
  • Lead section
    Complete-linkage clustering is one of several methods of agglomerative hierarchical clustering.
  • In Field: Machine Learning, Lead sentence
    Complete-linkage clustering is one of several methods of agglomerative hierarchical clustering.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.