Dendrogram seriation using simulated annealing

Authors:
Steven A. Morris;Benyam Asnake;Gary G. Yen
Affiliations:
Electrical and Computer Engineering, Oklahoma State University, 202 Engineering So., Stillwater, OK;Electrical and Computer Engineering, Oklahoma State University, 202 Engineering So., Stillwater, OK;Electrical and Computer Engineering, Oklahoma State University, 202 Engineering So., Stillwater, OK
Venue:
Information Visualization
Year:
2003

Citing 6
Cited 2

Applying row-column permutation to matrix representations of large citation networks

Information Processing and Management: an International Journal
The Travelling Salesman and the Pq-Tree

Mathematics of Operations Research
Domain visualization using VxInsight for science and technology management

Journal of the American Society for Information Science and Technology
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Time line visualization of research fronts

Journal of the American Society for Information Science and Technology
Linked

Linked

Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation

APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
Human-centered visualization environments

Human-centered visualization environments

Quantified Score

Hi-index	0.00

Visualization

Abstract

Seriation is the ordering of the leaves of a dendrogram, such that leaves representing similar items are placed near each other according to some metric, within the constraints of the cluster tree. Such ordering greatly aids the interpretation of the relations represented by the dendrogram and reduces visual misinterpretation caused by unrelated items from different subtrees being placed near each other during random ordering. The seriation method presented here uses simulated annealing to find an approximately optimal dendrogram ordering by minimizing a penalty function. The method employs a 'similarity weighted distance' penalty function that tends to avoid artifacts introduced by the traveling salesman problem algorithms commonly used for dendrogram seriation. Examples are given showing the effectiveness of the method in presenting dendrograms of the structure of a social network, and additional examples show an application for interpreting the structure of a network of journal papers covering the subject of anthrax research.