A Least Squares Algorithm for Fitting Additive Trees to Proximity Data
Open Access
- 1 December 1983
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 48 (4) , 621-626
- https://doi.org/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.Keywords
This publication has 7 references indexed in Scilit:
- Spatial Versus Tree Representations of Proximity DataPsychometrika, 1982
- Free trees and bidirectional trees as representations of psychological distanceJournal of Mathematical Psychology, 1978
- Restart procedures for the conjugate gradient methodMathematical Programming, 1977
- Additive Similarity TreesPsychometrika, 1977
- Spatial, Non-Spatial and Hybrid Models for ScalingPsychometrika, 1976
- Unrooted trees for numerical taxonomyJournal of Applied Probability, 1974
- Multidimensional Similarity of LettersPerceptual and Motor Skills, 1969