ISSN:
1432-1343
Keywords:
Classical scaling
;
ELEGANT algorithm
;
Newton-Raphson
;
Squared distances
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01896985
Permalink