Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2025-01-05T14:59:32.903Z Has data issue: false hasContentIssue false

A Generalization of Takane's Algorithm for Dedicom

Published online by Cambridge University Press:  01 January 2025

Henk A. L. Kiers*
Affiliation:
University of Groningen
Jos M. F. ten Berge
Affiliation:
University of Groningen
Yoshio Takane
Affiliation:
McGill University
Jan de Leeuw
Affiliation:
University of California, Los Angeles
*
Requests for reprints should be sent to Henk A. L. Kiers, Department of Psychology, Grote Markt 31/32, 9712 HV Groningen, THE NETHERLANDS.

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.

Type
Original Paper
Copyright
Copyright © 1990 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Financial Support by the Netherlands organization for scientific research (NWO) is gratefully acknowledged. The authors are obliged to Richard Harshman.

References

de Leeuw, J. (1983). Notes on DEDICOM. Unpublished manuscript.Google Scholar
de Leeuw, J., Heiser, W. J. (1980). Multidimensional scaling with restrictions on the configuration. In Krishnaiah, P. R. (Eds.), Multivariate analysis V (pp. 501522). Amsterdam: North-Holland.Google Scholar
Eckart, C., Young, G. (1936). The approximation of one matrix by another of lower rank. Psychometrika, 1, 211218.CrossRefGoogle Scholar
Gower, J. C. et al. (1977). The analysis of asymmetry and orthogonality. In Barra, J. et al. (Eds.), Recent Developments in Statistics (pp. 109123). Amsterdam: North-Holland.Google Scholar
Green, B. F. (1969). Best linear composites with a specified structure. Psychometrika, 34, 301318.CrossRefGoogle Scholar
Harshman, R. A. (1978, August). Models for analysis of asymmetrical relationships among N objects or stimuli. Paper presented at the First Joint Meeting of the Psychometric Society and the Society for Mathematical Psychology, Hamilton, Ontario.Google Scholar
Harshman, R. A. (1981). DEDICOM multidimensional analysis of skew-symmetric data. Part 1. Theory. Unpublished technical memorandum, Bell Laboratories, Murray Hill, NJ.Google Scholar
Harshman, R. A., Green, P. E., Wind, Y., Lundy, M. E. (1982). A model for the analysis of asymmetric data in marketing research. Marketing Science, 1, 205242.CrossRefGoogle Scholar
Harshman, R. A., & Kiers, H. A. L. (1987, June). Algorithms for DEDICOM analysis of asymmetric data. Paper presented at the European Meeting of the Psychometric Society, Enschede.Google Scholar
Kiers, H. A. L. (1989). An alternating least squares algorithm for fitting the two- and three-way DEDICOM model and the IDIOSCAL model. Psychometrika, 54, 515521.CrossRefGoogle Scholar
Ramsay, J. O. (1975). Solving implicit equations in psychometric data analysis. Psychometrika, 40, 337360.CrossRefGoogle Scholar
Takane, Y. (1985). Diagonal Estimation in DEDICOM. Proceedings of the 1985 Annual Meeting of the Behaviormetric Society (pp. 100101). Sapporo.Google Scholar
ten Berge, J. M. F. (1983). A generalization of Kristof's theorem on the trace of certain matrix products. Psychometrika, 48, 519523.CrossRefGoogle Scholar