Optimally Ordered Orthogonal Neighbor Joining Trees for Hierarchical Cluster Analysis

We propose to use optimally ordered orthogonal neighbor-joining (O 3 NJ) trees as a new way to visually explore cluster structures and outliers in multi-dimensional data. Neighbor-joining (NJ) trees are widely used in biology, and their visual representation is similar to that of dendrograms. The co...

Description complète

Détails bibliographiques

Publié dans:	IEEE transactions on visualization and computer graphics. - 1996. - 30(2024), 8 vom: 27. Aug., Seite 5034-5046
Auteur principal:	Ge, Tong (Auteur)
Autres auteurs:	Luo, Xu, Wang, Yunhai, Sedlmair, Michael, Cheng, Zhanglin, Zhao, Ying, Liu, Xin, Deussen, Oliver, Chen, Baoquan
Format:	Article en ligne
Langue:	English
Publié:	2024
Accès à la collection:	IEEE transactions on visualization and computer graphics
Sujets:	Journal Article