An Efficient Metric Combinatorial Algorithm for Fitting Additive Trees.
暂无分享,去创建一个
[1] G. Soete. A least squares algorithm for fitting additive trees to proximity data , 1983 .
[2] Hervé Abdi,et al. Additive-Tree Representations , 1990 .
[3] L. Hubert,et al. Combinatorial Data Analysis , 1992 .
[4] L. Hubert,et al. Iterative projection strategies for the least-squares fitting of tree structures to proximity data , 1995 .
[5] H. Abdi,et al. Tree Representations of Associative Structures in Semantic and Episodic Memory Research , 1984 .
[6] A. Tversky,et al. Representations of perceptions of risks , 1984 .
[7] J. Cunningham,et al. Free trees and bidirectional trees as representations of psychological distance , 1978 .
[8] B Tversky,et al. Descriptions and depictions of environments , 1992, Memory & cognition.
[9] G. Soete. Additive-tree representations of incomplete dissimilarity data , 1984 .
[10] James G. Orter. ADDTREE/P: A PASCAL program for fitting additive trees based on Sattath and Tversky’s ADDTREE algorithm , 1982 .
[11] Wayne S. DeSarbo,et al. Chapter 5 Non-spatial tree models for the assessment of competitive market structure: An integrated review of the marketing and psychometric literature , 1993, Marketing.
[12] A. Tversky,et al. Additive similarity trees , 1977 .
[13] A. Dobson. Unrooted trees for numerical taxonomy , 1974, Journal of Applied Probability.
[14] Geert De Soete,et al. Tree and other network models for representing proximity data , 1996 .
[15] George W. Furnas,et al. Metric family portraits , 1989 .
[16] S. Hakimi,et al. The distance matrix of a graph and its tree realization , 1972 .
[17] A. Tversky,et al. Spatial versus tree representations of proximity data , 1982 .