A generalization of Takane's algorithm for dedicom |
| |
Authors: | Henk A. L. Kiers Jos M. F. ten Berge Yoshio Takane Jan de Leeuw |
| |
Affiliation: | (1) University of Groningen, The Netherlands;(2) Department of Psychology, Grote Markt 31/32, 9712 HV Groningen, The Netherlands;(3) Mcgill University, Canada;(4) University of California, Los Angeles |
| |
Abstract: | ![]() An algorithm is described for fitting the DEDICOM model for the analysis of asymmetric data matrices. This algorithm generalizes an algorithm suggested by Takane in that it uses a damping parameter in the iterative process. Takane's algorithm does not always converge monotonically. Based on the generalized algorithm, a modification of Takane's algorithm is suggested such that this modified algorithm converges monotonically. It is suggested to choose as starting configurations for the algorithm those configurations that yield closed-form solutions in some special cases. Finally, a sufficient condition is described for monotonic convergence of Takane's original algorithm.Financial Support by the Netherlands organization for scientific research (NWO) is gratefully acknowledged. The authors are obliged to Richard Harshman. |
| |
Keywords: | DEDICOM least squares fitting majorization |
本文献已被 SpringerLink 等数据库收录! |