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...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on visualization and computer graphics. - 1996. - 30(2024), 8 vom: 13. Juli, Seite 5034-5046
|
|---|
| 1. Verfasser: |
Ge, Tong
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Luo, Xu,
Wang, Yunhai,
Sedlmair, Michael,
Cheng, Zhanglin,
Zhao, Ying,
Liu, Xin,
Deussen, Oliver,
Chen, Baoquan |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2024
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on visualization and computer graphics
|
|---|
| Schlagworte: | Journal Article |
|---|