The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Software » comp.soft-sys.matlab

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: dendrogram problem
Replies: 4   Last Post: Apr 23, 2012 5:16 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Qamar Abbas

Posts: 1
Registered: 4/22/12
Re: dendrogram problem
Posted: Apr 22, 2012 5:34 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Peter Perkins <> wrote in message <fc1qjg$cjf$>...
> Eitan wrote:
> > from dendrogram help:
> > "A dendrogram consists of many U-shaped lines connecting
> > objects in a
> > hierarchical tree. The height of each U represents the
> > distance between the
> > two objects being connected. If there were 30 or fewer data
> > points in the
> > original dataset, each leaf in the dendrogram corresponds
> > to one data point.
> > If there were more than 30 data points, the complete tree
> > can look crowded,
> > and dendrogram collapses lower branches as necessary,
> > so that some leaves in the plot correspond to more than one
> > data point."
> > so i guess thers not much you can do. maybe write your own
> > code.

> Another alternative would be to read the next paragraph of the help:
> "DENDROGRAM(Z,P) generates a dendrogram with no more than P leaf nodes, by
> collapsing lower branches of the tree. To display the complete tree, set P = 0."

>> Dear the one solution to use more than 30 data points in the deprogram is to use the following code


i tested it. it is working now but it display only one color dendrogram....

if you display colored dendrogram of more than 30 data points then please share that one also.


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.