Leaf Ordering Of Linkage Tree

1 次查看（过去 30 天）

Daniele 2016-11-29

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/314573-leaf-ordering-of-linkage-tree

评论： Daniele 2016-12-1

Hi, I have a set N M-dimensional samples. I applied the linkage function in order to obtain the binary tree and I am trying to understand the difference between the leaf ordering performed by optimalleaforder and the one performed by the dendrogram function. I would expect that the optimalleaforder put near to one another leaf which are higly similar. Actually I could never test it due to the very long computational time. The ordering in dendrogram seems to do a similar thing but in much less time. I'm trying to figure out how it works but there are no references and I'm still working with the code.

Do you know what is the difference?

Thank you

2 个评论
显示无隐藏无

Daniele 2016-11-30

I run also the optimalleaforder function and actually the results are similar. But whereas the dendrogram ordering takes about 1 minute the optimalleaforder takes ours. I can't really understand why

Daniele 2016-12-1

From the code I noticed that the optimalleaforder is based on the distance between the leah while the ordering in the dendrogram is based on only on the hierarchy of the nodes.

请先登录，再进行评论。

请先登录，再回答此问题。