Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-12T19:08:52.786Z 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.

Information

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.)

Article purchase

Temporarily unavailable