A least squares algorithm for fitting additive trees to proximity data

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.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.