Psychometrika

, Volume 48, Issue 4, pp 621–626

A least squares algorithm for fitting additive trees to proximity data

Authors

  • Geert De Soete
    • Department of PsychologyUniversity of Ghent
Notes And Comments

DOI: 10.1007/BF02293884

Cite this article as:
De Soete, G. Psychometrika (1983) 48: 621. doi:10.1007/BF02293884

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.

Key words

tree structuresclusteringproximity data

Copyright information

© The Psychometric Society 1983