Hostname: page-component-745bb68f8f-5r2nc Total loading time: 0 Render date: 2025-01-07T16:59:20.519Z Has data issue: false hasContentIssue false

Interpreting Degenerate Solutions in Unfolding by Use of the Vector Model and the Compensatory Distance Model

Published online by Cambridge University Press:  01 January 2025

K. Van Deun*
Affiliation:
Catholic University of Leuven
P. J. F. Groenen
Affiliation:
Erasmus University Rotterdam
W. J. Heiser
Affiliation:
Leiden University
F. M. T. A. Busing
Affiliation:
Leiden University
L. Delbeke
Affiliation:
Catholic University of Leuven
*
Requests for reprints should be sent to K. Van Deun, Department of Psychology, Catholic University of Leuven, Tiensestraat 102, B-3000 Leuven, BELGIUM. E-mail: katrijn.vandeun@psy.kuleuven.ac.be

Abstract

In this paper, we reconsider the merits of unfolding solutions based on loss functions involving a normalization on the variance per subject. In the literature, solutions based on Stress-2 are often diagnosed to be degenerate in the majority of cases. Here, the focus lies on two frequently occurring types of degeneracies. The first type typically locates some subject points far away from a compact cluster of the other points. In the second type of solution, the object points lie on a circle. In this paper, we argue that these degenerate solutions are well fitting and informative. To reveal the information, we introduce mixtures of plots based on the ideal point model of unfolding, the vector model, and on the signed distance model. In addition to a different representation, we provide a new iterative majorization algorithm to optimize the average squared correlation between the distances in the configuration and the transformed data per individual. It is shown that this approach is equivalent to minimizing Kruskal’s Stress-2.

Type
Original Paper
Copyright
Copyright © 2005 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.)

References

Borg, I., & Groenen, P.J.F. (1997). Modern Multidimensional Scaling. New York: Springer-Verlag.CrossRefGoogle Scholar
Busing, F.M.T.A., Groenen, P.J.F., & Heiser, W.J. (in press). Avoiding degeneracy in multidimensional unfolding by penalizing on the coefficient of variation. Psychometrika.Google Scholar
Carroll, J.D. (1972). Individual differences and multidimensional scaling. In Shepard, R.N., Romney, A.K., & Nerlove, S.B. (Eds.), Multidimensional Scaling: Theory and Applications in the Behavioral Sciences (Vol 1 (pp. 105155). New York: Seminar Press.Google Scholar
Coombs, C.H. (1950). Psychological scaling without a unit of measurement. Psychological Review, 57, 148158.CrossRefGoogle ScholarPubMed
Coombs, C.H. (1964). A Theory of Data. New York: Wiley.Google Scholar
Delbeke, L. (1968). Construction of Preference Spaces: An Investigation into the Applicability of Multidimensional Scaling Models. Leuven: Leuvense universitaire uitgaven.Google Scholar
De Leeuw, J. (1977). Applications of convex analysis to multidimensional scaling. In Barra, J.R., Romier, G., & van Cutsem, B. (Eds.), Recent Developments in Statistics (pp. 133145). North-Holland: Amsterdam, The Netherlands.Google Scholar
De Leeuw, J. (1983). On Degenerate Nonmetric Unfolding Solutions (Tech. Rep.). Department of data theory, FSW/RUL.Google Scholar
De Leeuw, J. (1994). Block relaxation algorithms in statistics. In Bock, H.H., Lenski, W., & Richter, M.M. (Eds.), Information Systems and Data Analysis (pp. 308325). Berlin: Springer-Verlag.CrossRefGoogle Scholar
De Leeuw, J., & Heiser, W.J. (1977). Convergence of correction-matrix algorithms for multidimensional scaling. In Lingoes, J.C., Roskam, E.E., & Borg, I. (Eds.), Geometric Representations of Relational Data (pp. 735752). Ann Arbor, MI: Mathesis Press.Google Scholar
DeSarbo, W.S., & Carroll, J.D. (1985). Three-way metric unfolding via alternating least squares. Psychometrika,, 50, 275300.CrossRefGoogle Scholar
Green, P.E., & Rao, V.R. (1972). Applied Multidimensional Scaling: A Comparison of Approaches and Algorithms. New York: Holt: Rinehart and Winston.Google Scholar
Groenen, P.J.F., Heiser, W.J., & Meulman, J.J. (1999). Global optimization in least-squares multidimensional scaling by distance smoothing. Journal of Classification, 16, 225254.CrossRefGoogle Scholar
Groenen, P.J.F., Os, B.-J., & Meulman, J.J. (2000). Optimal scaling by alternating length-constrained nonnegative least squares with application to distance-based analysis. Psychometrika, 65, 511524.CrossRefGoogle Scholar
Heiser, W.J. (1989). Order invariant unfolding analysis under smoothness restrictions. In De Soete, G., Feger, H., & Klauer, K.C. (Eds.), New Developments in Psychological Choice Modelling (pp. 331). Amsterdam: Elsevier Science.CrossRefGoogle Scholar
Kim, C., Rangaswamy, A., & DeSarbo, W.S. (1999). A quasi-metric approach to multidimensional unfolding for reducing the occurrence of degenerate solutions. Multivariate Behavioral Research, 34, 143180.CrossRefGoogle ScholarPubMed
Kruskal, J.B. (1964). Nonmetric multidimensional scaling: A numerical method. Psychometrika, 29, 115129.CrossRefGoogle Scholar
Kruskal, J.B. (1965). Analysis of factorial experiments by estimating monotone transformations of the data. Journal of the Royal Statistical Society B, 27, 251563.CrossRefGoogle Scholar
Kruskal, J.B., & Carroll, J.D. (1969). Geometrical models and badness-of-fit functions. In Krishnaiah, P.R. (Eds.), Multivariate Analysis (vol 2) (pp. 639671). New York: Academic Press.Google Scholar
Roskam, E.E.C.I. (1968). Metric Analysis of Ordinal Data in Psychology. Voorschoten: VAM.Google Scholar
Tucker, L.R. (1960). Intra-individual and inter-individual multidimensionality. In Gulliksen, H., & Messick, S. (Eds.), Psychological Scaling: Theory and Applications (pp. 155167). New York: Wiley.Google Scholar