Dendrogram Seriation Using Simulated Annealing

Information Visualization

Volumn 2, Issue 2, 2003, Pages 95-104

  Morris, Steven A ^a   Asnake, Benyam ^a   Yen, Gary G ^a  

^a Oklahoma State University   (United States)

Author keywords

bibliometrics; Dendrogram; seriation; simulated annealing; social networks; visualization

Indexed keywords

EID: 84998186625     PISSN: 14738716     EISSN: 14738724     Source Type: Journal    
DOI: 10.1057/palgrave.ivs.9500042     Document Type: Article

References (21)

1. Bar-Joseph Z, Demaine E, Gifford D, Hamel A, Jaakola T, Srebro N. Kary clustering with optimal leaf ordering for gene expression data. Proceedings of the Second Workshop on Algorithms in Bioinformatics 2002 (Rome, Italy. September 17–21, 2002).
2. Barabasi A. Linked. Perseus Publishing: Cambridge, MA, 2002; 280pp.
3. Bar-Joseph Z, Gifford D, Jaakkola T. Fast optimal leaf ordering for hierarchical clustering. Bioinformatics 2001; 17: S22–S29.
4. Forina M, Armanino C, Raggio V. Clustering with dendrograms on interpretation variables. Analytica Chimica Acta 2002; 454: 13–19.
5. Eisen M, Spellman P, Brown P, Botstein D. Cluster analysis and display of genome-wide expression patterns. Proceedings of the National Academy of Science of the United States of America 1998; 95: 14863–14868.
6. Robinson W. A method for chronologically ordering archaeological deposits. American Antiquity 1951; 16: 293–301.
7. Deutsch S, Martin J. An ordering algorithm for analysis of data arrays. Operations Research 1971; 19: 1350–1362.
8. Brower J, Kile K. Seriation of an original data matrix as applied to paleoecology. Lethaia 1988; 21: 79–93.
9. McCormick W, Schweitzer P, White T. Problem decomposition and data reorganization by a clustering technique. Operations Research 1972; 20: 993–1009.
10. Lenstra J. Clustering a data array and the traveling salesman problem. Operations Research 1974; 22: 413–414.
11. Gruvaeus G, Wainer H. Two additions to hierarchical cluster analysis. British Journal of Mathematical and Statistical Psychology 1972; 25: 200–206.
12. Gale N, Halperin W, Costanzo C. Unclassed matrix shading and optimal ordering in hierarchical cluster analysis. Journal of Classification 1984; 1: 75–92.
13. Degerman R. Ordered binary trees constructed through an application of Kendall's tau. Psychometrika 1982; 47: 523–527.
14. Wishart D. ClustanGraphics3 interactive graphics for cluster analysis. In: GaulW, Locarek-JungeH, (Eds.). Classification in the Information Age. Springer: Berlin, 1999; 268–275.
15. Burkard R, Deinko V, Woeginger G. The traveling salesman and the pq-tree. Mathematics of Operations Research 1998; 23: 613–623.
16. Morris S, Wu Z, Asnake B, Yen G. Timeline visualization of research fronts. Journal of the American Society for Information Science and Technology 2003; 54: 413–422.
17. Kirkpatrick S, Gelatt C, Vecchi M. Optimization by simulated annealing. Science 1983; 220: 671–680.
18. Packer C. Applying row-column permutation to matrix representations of large citation networks. Information Processing and Management 1989; 25: 307–314.
19. Zachary W. An information flow model for conflict and fission in small groups. Journal of Anthropological Research 1977; 33: 452–473.
20. Girvan M, Newman M. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 2002; 99: 7821–7826.
21. Boyack K, Wylie B, Davidson G. Domain Visualization using VxInsight for science and technology management. Journal of the American Society for Information Science and Technology 2002; 53: 764–774.