Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
No abstract is available for this item.
Volume (Year): 4 (1987)
Issue (Month): 2 (September)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=101794|
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Anuška Ferligoj & Vladimir Batagelj, 1983. "Some types of clustering with relational constraints," Psychometrika, Springer, vol. 48(4), pages 541-552, December.
- Geert Soete & Wayne DeSarbo & J. Carroll, 1985. "Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm," Journal of Classification, Springer, vol. 2(1), pages 173-192, December.
- J. Carroll & Linda Clark & Wayne DeSarbo, 1984. "The representation of three-way proximity data by single and multiple tree structure models," Journal of Classification, Springer, vol. 1(1), pages 25-74, December.
- Geert Soete, 1983. "A least squares algorithm for fitting additive trees to proximity data," Psychometrika, Springer, vol. 48(4), pages 621-626, December.
When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:4:y:1987:i:2:p:155-173. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.