A multiple-comparisons method based on the distribution of the root node distance of a binary tree
- 195 Downloads
This article proposesan easy to implement cluster-based method for identifying groups of nonhom ogeneous means. The method overcomes the common problem of the classical multiple-comparison methods that lead to the construction of groups that often have substantial overlap. In addition, it solves the problem of other cluster-based methods that do not have a known level of significance and are not easy to apply. The new procedure is compared by simulation with a set of classical multiple-comparison methods and a cluster-based one. Results show that the new procedure compares quite favorably with those included in this article.
Key WordsCluster analysis Cluster-based multiple comparisons Complexity index Dendograms Genotype evaluation
Unable to display preview. Download preview PDF.
- Gates, C. E., and Bilbro, J. D. (1978), “Illustration of Cluster Analysis Method for Means Separation,” Agronomy Journal, 70, 462–465.Google Scholar
- Jolliffe, I. T. (1975), “Cluster Analysis as a Multiple Comparíson Method,” Applied Statistics, Proceedings of Conference at Dalhousie University, Halifax, 159–168.Google Scholar
- Knuth, D. E. (1981), The Art of Computer Programming (Vol. 2, 2nd ed.), Seminumerical Algorithms, Reading, PA: Addison-Wesley.Google Scholar
- Press, W. H., Flannery, P., Teukolsky, S. A., and Vetterling, W. T. (1986), Numerical Recipes, Cambridge: Cambridge University Press.Google Scholar
- Spath, H. (1980), Cluster Analysis Algorithms, New York: Wiley.Google Scholar