Leaf Ordering Of Linkage Tree

1 visualización (últimos 30 días)
Daniele
Daniele el 29 de Nov. de 2016
Comentada: Daniele el 1 de Dic. de 2016
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 comentarios
Daniele
Daniele el 30 de Nov. de 2016
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
Daniele el 1 de Dic. de 2016
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.

Iniciar sesión para comentar.

Respuestas (0)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by