This is the authors' abstract. We don't add key points for this paper.
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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Geert De Soete (1983) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: