Los puntos clave no están disponibles para este artículo en este momento.
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.
Geert De Soete (Thu,) studied this question.