Dendrogram

Known as: Dendogram, Dendrograms 
A dendrogram (from Greek dendro "tree" and gramma "drawing") is a tree diagram frequently used to illustrate the arrangement of the clusters produced… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This paper introduces an innovative approach for detecting a suboptimal partition starting from the dendrogram produced by a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
With the advent of game telemetry, contemporary game designers have access to a huge amount of real-time data about player… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The brain network is usually constructed by estimating the connectivity matrix and thresholding it at an arbitrary level. The… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Abstract: Within the special geometry of the simplex, the sample space of compositional data, compositional orthonormal… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
SUMMARY Hierarchical clustering is a widely used method for detecting clusters in genomic data. Clusters are defined by cutting… (More)
  • figure 1
Is this relevant?
2007
2007
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2006
2006
Euclidean distance is commonly involved in calculating functional diversity (FD), for example, in measures based on dendrogram… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present a new method for clustering based on compression. The method does not use subject-specific features or background… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Main point Sibson gives an O(n 2) algorithm for single-linkage clustering, and proves that this algorithm achieves the… (More)
  • figure 1
  • figure 2
Is this relevant?