Hostname: page-component-7dd5485656-tbj44 Total loading time: 0 Render date: 2025-10-30T05:58:46.114Z Has data issue: false hasContentIssue false
  • English
  • Français

Ordered Binary Trees Constructed through an Application of Kendall's Tau

Published online by Cambridge University Press:  01 January 2025

Richard Degerman
Richard Degerman*
Affiliation:
University of California, Irvine
*
Requests for reprints should be sent to: Richard Degerman, School of Social Sciences, University of California, lrvine, CA 92717.
Get access Rights & Permissions [Opens in a new window]

Abstract

A procedure is described for orienting the nodes of a binary tree to maximize the Kendall rank order correlation (tau) between node order and a given external criterion. The procedure is computationally efficient and is based on application of an ordered set of node tests.

Keywords

cluster analysis

Information

Type
Notes And Comments
Information
Psychometrika , Volume 47 , Issue 4 , December 1982 , pp. 523 - 527
Copyright
Copyright © 1982 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Gruvaeus, G. & Wainer, H. Two additions to hierarchical cluster analysis. British Journal of Mathematical and Statistical Psychology, 1972, 25, 200–206.CrossRefGoogle Scholar
Kendall, M. G. Rank correlation methods, 1970, London: Griffin.Google Scholar
Miller, G. A. Psychological method to investigate verbal concepts. Journal of Mathematical Psychology, 1969, 6, 169–191.CrossRefGoogle Scholar