Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Global Optimization in Least-Squares Multidimensional Scaling by Distance Smoothing

Global Optimization in Least-Squares Multidimensional Scaling by Distance Smoothing Least-squares multidimensional scaling is known to have a serious problem of local minima, especially if one dimension is chosen, or if city-block distances are involved. One particular strategy, the smoothing strategy proposed by Pliner (1986, 1996), turns out to be quite successful in these cases. Here, we propose a slightly different approach, called distance smoothing. We extend distance smoothing for any Minkowski distance. In addition, we extend the majorization approach to multidimensional scaling to have a one-step update for Minkowski parameters larger than 2 and use the results for distance smoothing. We present simple ideas for finding quadratic majorizing functions. The performance of distance smoothing is investigated in several examples, including two simulation studies. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Classification Springer Journals

Global Optimization in Least-Squares Multidimensional Scaling by Distance Smoothing

Loading next page...
 
/lp/springer-journals/global-optimization-in-least-squares-multidimensional-scaling-by-uSLfk0O6GB

References (31)

Publisher
Springer Journals
Copyright
Copyright © 1999 by Springer-Verlag New York Inc.
Subject
Statistics; Statistical Theory and Methods; Pattern Recognition; Bioinformatics; Signal, Image and Speech Processing; Psychometrics; Marketing
ISSN
0176-4268
eISSN
1432-1343
DOI
10.1007/s003579900055
Publisher site
See Article on Publisher Site

Abstract

Least-squares multidimensional scaling is known to have a serious problem of local minima, especially if one dimension is chosen, or if city-block distances are involved. One particular strategy, the smoothing strategy proposed by Pliner (1986, 1996), turns out to be quite successful in these cases. Here, we propose a slightly different approach, called distance smoothing. We extend distance smoothing for any Minkowski distance. In addition, we extend the majorization approach to multidimensional scaling to have a one-step update for Minkowski parameters larger than 2 and use the results for distance smoothing. We present simple ideas for finding quadratic majorizing functions. The performance of distance smoothing is investigated in several examples, including two simulation studies.

Journal

Journal of ClassificationSpringer Journals

Published: Feb 28, 2014

There are no references for this article.