论文信息 - A least squares algorithm for fitting additive trees to proximity data

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.

G. Soete

[1] Teodor Kuennapas,et al. Multidimensional Similarity of Letters , 1969, Perceptual and motor skills.

[2] A. Dobson. Unrooted trees for numerical taxonomy , 1974, Journal of Applied Probability.

[3] J. Carroll,et al. Spatial, non-spatial and hybrid models for scaling , 1976 .

[4] A. Tversky,et al. Additive similarity trees , 1977 .

[5] J. Cunningham,et al. Free trees and bidirectional trees as representations of psychological distance , 1978 .

[6] A. Tversky,et al. Spatial versus tree representations of proximity data , 1982 .