Hostname: page-component-89b8bd64d-mmrw7 Total loading time: 0 Render date: 2026-05-10T08:13:52.176Z Has data issue: false hasContentIssue false

An Efficient Alternating Least-Squares Algorithm to Perform Multidimensional Unfolding

Published online by Cambridge University Press:  01 January 2025

Michael J. Greenacre*
Affiliation:
University of South Africa
Michael W. Browne
Affiliation:
University of South Africa
*
Requests for reprints should be sent to Michael J. Greenacre, Department of Statistics, University of South Africa, PO Box 392, Pretoria 0001, SOUTH AFRICA.

Abstract

We consider the problem of least-squares fitting of squared distances in unfolding. An alternating procedure is proposed which fixes the row or column configuration in turn and finds the global optimum of the objective criterion with respect to the free parameters, iterating in this fashion until convergence is reached. A considerable simplification in the algorithm results, namely that this conditional global optimum is identified by performing a single unidimensional search for each point, irrespective of the dimensionality of the unfolding solution.

Information

Type
Original Paper
Copyright
Copyright © 1986 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