Dendrogram plot

`dendrogram(tree)`

`dendrogram(tree,Name,Value)`

`dendrogram(tree,P)`

`dendrogram(tree,P,Name,Value)`

`H = dendrogram(___)`

```
[H,T,outperm]
= dendrogram(___)
```

`dendrogram(`

generates
a dendrogram plot of the hierarchical binary cluster tree. A dendrogram
consists of many `tree`

)*U*-shaped lines that connect data
points in a hierarchical tree. The height of each *U* represents
the distance between the two data points being connected.

If there are 30 or fewer data points in the original data set, then each leaf in the dendrogram corresponds to one data point.

If there are more than 30 data points, then

`dendrogram`

collapses lower branches so that there are 30 leaf nodes. As a result, some leaves in the plot correspond to more than one data point.

`dendrogram(`

uses
additional options specified by one or more name-value pair arguments.`tree`

,`Name,Value`

)

`dendrogram(`

uses
additional options specified by one or more name-value pair arguments.`tree`

,`P`

,`Name,Value`

)

generates
a dendrogram plot and returns a vector of line handles. You can use
any of the input arguments from the previous syntaxes.`H`

= dendrogram(___)

`[`

also returns a vector containing
the leaf node number for each object in the original data set, `H`

,`T`

,`outperm`

]
= dendrogram(___)`T`

,
and a vector giving the order of the node labels of the leaves as
shown in the dendrogram, `outperm`

.

It is useful to return

`T`

when the number of leaf nodes,`P`

, is less than the total number of data points, so that some leaf nodes in the display correspond to multiple data points.The order of the node labels given in

`outperm`

is from left to right for a horizontal dendrogram, and from bottom to top for a vertical dendrogram.

`cluster`

| `clusterdata`

| `cophenet`

| `inconsistent`

| `linkage`

| `pdist`

| `silhouette`