The Young-Householder algorithm and the least squares multidimensional scaling of squared distances |
| |
Authors: | M. W. Browne |
| |
Affiliation: | (1) Department of Statistics, University of South Africa, P.O. Box 392, 0001 Pretoria, South Africa |
| |
Abstract: | It is shown that replacement of the zero diagonal elements of the symmetric data matrix of approximate squared distances by certain other quantities in the Young-Householder algorithm will yield a least squares fit to squared distances instead of to scalar products. Iterative algorithms for obtaining these replacement diagonal elements are described and relationships with the ELEGANT algorithm (de Leeuw 1975; Takane 1977) are discussed. In large residual situations a penalty function approach, motivated by the ELEGANT algorithm, is adopted. Empirical comparisons of the algorithms are given.An early version of this paper was presented at the Multidimensional Data Analysis Workshop, Pembroke College, Cambridge, July 1985. I want to thank Jan de Leeuw and Yoshio Takane for bringing the ELEGANT algorithm to my attention and for clarifying its rationale and notation. My thanks go also to Stephen du Toit for help with the ALSCAL computations reported in Section 7. |
| |
Keywords: | Classical scaling ELEGANT algorithm Newton-Raphson Squared distances |
本文献已被 SpringerLink 等数据库收录! |
|