Abstract
An elegant algorithm for computing an MDS solution is discussed in this chapter. We reintroduce the Stress function that measures the deviance of the distances between points in a geometric space and their corresponding dissimilarities. Then, we focus on how a function can be minimized An easy and powerful minimization strategy is the principle of minimizing a function by iterative majorization. This method is applied in the SMACOF algorithm for minimizing Stress.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Borg, I., Groenen, P. (1997). A Majorization Algorithm for Solving MDS. In: Modern Multidimensional Scaling. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2711-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2711-1_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-2713-5
Online ISBN: 978-1-4757-2711-1
eBook Packages: Springer Book Archive