Abstract
Recent clustering procedures provide an ultrametric or additive tree representation of proximity data. Various operations can be performed on such trees without affecting the goodness of fit of the representation. In an ultrametric tree, subtrees can be rotated without changing the ultrametric tree distances. Additive trees are usually displayed as rooted trees, although the placement of the root is arbitrary. Commonly, a user wants to find the rotations of the subtrees and—with additive trees—the placement of the root that lead to the best interpretation of the tree representation. While some analytic procedures have been presented in the literature, none of them is entirely satisfactory. In this paper, a software system is described that allows the user to interactively manipulate an ultrametric or additive tree until—in his or her view—the best representation is found. This software system is implemented in a portable way using the X Window System.
Supported as “Bevoegdverklaard Navorser” of the Belgian “Nationaal Fonds voor Wetenschappelijk Onderzoek”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adobe Systems (1985), PostScript Language Reference Manual, Addison-Wesley, Reading, Massachusetts.
Critchley, F, and Heiser, W. (1988), Hierarchical Trees Can be Perfectly Scaled in One Dimension, Journal of Classification, 5, 5–20.
Degerman, R. (1982), Ordered Binary Trees Constructed Through an Application of Kendall’s Tau, Psydiometrika, 47, 523–527.
De Soete, G. (1984), Computer Programs for Fitting Ultrametric and Additive Trees to Proximity Data by Least Squares Methods, Behavior Research Methods, Instruments, & Computers, 16, 551–552.
De Soete, G., Desarbo, W.S., Furnas, G.W., and Carroll, J.D. (1984), The Estimation of Ultrametric and Path Length Trees from Rectangular Proximity Data, Psychometrika, 49, 289–310.
Gruvaeus, G., and Wainer, H. (1972), Two Additions to Hierarchical Cluster Analysis, British Journal of Mathematical and Statistical Psychology, 25, 200–206.
Johnson, S.C. (1967), Hierarchical Clustering Schemes, Psychometrika, 32, 241–254.
Kernighan, B.W., and Ritchie, D.M. (1988), The C Programming Language, Prentice-Hall, Englewood Cliffs, New Jersey.
Kruskal, J.B., and Landwehr, J.M. (1983), Icicle Plots: Better Displays for Hierarchical Clustering, American Statistician, 37, 162–168.
Roberts, F. (1979), Measurement Theory, Addison-Wesley, Reading, Massachusetts.
Rousseeuw, P. J. (1986), A Visual Display for Hierarchical Classification, in: E. Diday, Y. Escoufier, L. Lebart, J. Pages, Y. Schektman and R. Tomassone (eds.), Data Analysis and Informatics, IV, North-Holland, Amsterdam, 743–748.
Sattath, S., and Tversky, A. (1977), Additive Similarity Trees, Psychometrika, 42, 319–345.
Scheifler, R.W., and Gettys, J. (1986), The X Window System, ACM Transactions on Graphics, 5, 79–109.
Scheifler, R.W., Gettys, J., and Newman, R. (1988), The X Window System, DEC Press, Massachusetts.
Young, D.A. (1989), X Window Systems Programming and Applications with Xt, Prentice Hall, Englewood Cliffs, New Jersey.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
De Soete, G., Vermeulen, J. (1993). Interactively Displaying Ultrametric and Additive Trees. In: Opitz, O., Lausen, B., Klar, R. (eds) Information and Classification. Studies in Classification, Data Analysis and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50974-2_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-50974-2_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56736-3
Online ISBN: 978-3-642-50974-2
eBook Packages: Springer Book Archive