Skip to main content
Log in

A least squares algorithm for fitting additive trees to proximity data

  • Notes And Comments
  • Published:
Psychometrika Aims and scope Submit manuscript

Abstract

A least squares algorithm for fitting additive trees to proximity data is described. The algorithm uses a penalty function to enforce the four point condition on the estimated path length distances. The algorithm is evaluated in a small Monte Carlo study. Finally, an illustrative application is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References notes

  • Carroll, J. D., & Pruzansky, S.Fitting of hierarchical tree structure (HTS) models, mixtures of HTS models, and hybrid models via mathematical programming and alternating least squares. Paper presented at the U.S.-Japan Seminar on Theory, Methods, and Applications of Multidimensional Scaling and Related Techniques, San Diego, August 1975.

  • Furnas, G. W.The construction of random, terminally labeled, binary trees. Unpublished paper, Bell Laboratories, Murray Hill, New Jersey, 1981.

References

  • Carroll, J. D. Spatial, nonspatial and hybrid models for scaling.Psychometrika, 1976,41, 439–463.

    Google Scholar 

  • Carroll, J. D., & Pruzansky, S. Discrete and hybrid scaling models. In E. D. Lantermann & H. Feger (Eds.),Similarity and choice. Bern: Huber, 1980.

    Google Scholar 

  • Cunningham, J. P. Free trees and bidirectional trees as representations of psychological distance.Journal of Mathematical Psychology, 1978,17, 165–188.

    Google Scholar 

  • Dobson, A. J. Unrooted trees for numerical taxonomy.Journal of Applied Probability, 1974,11, 32–42.

    Google Scholar 

  • Kuennapas, T., & Janson, A. J. Multidimensional similarity of letters.Perceptual & Motor Skills, 1969,28, 3–12.

    Google Scholar 

  • Powell, M. J. D. Restart procedures for the conjugate gradient method.Mathematical Programming, 1977,12, 241–254.

    Google Scholar 

  • Pruzansky, S., Tversky, A., & Carroll, J. D. Spatial versus tree representations of proximity data.Psychometrika, 1982,47, 3–24.

    Google Scholar 

  • Sattath, S., & Tversky, A. Additive similarity trees.Psychometrika, 1977,42, 319–345.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The author is “Aspirant” of the Belgian “Nationaal Fonds voor Wetenschappelijk Onderzoek”. The author is indebted to Professor J. Hoste for providing computer facilities at the Institute of Nuclear Sciences at Ghent.

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Soete, G. A least squares algorithm for fitting additive trees to proximity data. Psychometrika 48, 621–626 (1983). https://doi.org/10.1007/BF02293884

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02293884

Key words

Navigation