Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T02:04:55.003Z Has data issue: false hasContentIssue false

Cluster Differences Scaling with a Within-Clusters Loss Component and a Fuzzy Successive Approximation Strategy to Avoid Local Minima

Published online by Cambridge University Press:  01 January 2025

Willem J. Heiser*
Affiliation:
Department of Data Theory, Faculty of Social Sciences, Leiden University
Patrick J. F. Groenen
Affiliation:
Department of Data Theory, Faculty of Social Sciences, Leiden University
*
Requests for reprints should be addressed to Willem J. Heiser, Department of Data Theory, Faculty of Social Sciences, Leiden University, P.O. Box 9555, 2300 RB Leiden, THE NETHERLANDS.

Abstract

Cluster differences scaling is a method for partitioning a set of objects into classes and simultaneously finding a low-dimensional spatial representation of K cluster points, to model a given square table of dissimilarities among n stimuli or objects. The least squares loss function of cluster differences scaling, originally defined only on the residuals of pairs of objects that are allocated to different clusters, is extended with a loss component for pairs that are allocated to the same cluster. It is shown that this extension makes the method equivalent to multidimensional scaling with cluster constraints on the coordinates. A decomposition of the sum of squared dissimilarities into contributions from several sources of variation is described, including the appropriate degrees of freedom for each source. After developing a convergent algorithm for fitting the cluster differences model, it is argued that the individual objects and the cluster locations can be jointly displayed in a configuration obtained as a by-product of the optimization. Finally, the paper introduces a fuzzy version of the loss function, which can be used in a successive approximation strategy for avoiding local minima. A simulation study demonstrates that this strategy significantly outperforms two other well-known initialization strategies, and that it has a success rate of 92 out of 100 in attaining the global minimum.

Information

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