Abstract
Abstract : This paper considers numerical algorithms for finding local minimizers of metric multidimensional scaling problems. The two most common optimality criteria (STRESS and SSTRESS) are considered, the leading algorithms for each are carefully explicated, and a new algorithm is proposed. The new algorithm is based on Newton's method and relies on a parametrization that has not previously been used in multidimensional scaling algorithms. In contrast to previous algorithms, a very pleasant feature of the new algorithm is that it can be used with either the STRESS or the SSTRESS criterion. Numerical results are presented for the metric STRESS problem. These results are quite satisfying and, among other things, suggest that the well-known SMACOF-I algorithm tends to stop prematurely.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
