Skip to main content

A Comparison of Two Methods for Global Optimization in Multidimensional Scaling

  • Conference paper
Information and Classification

Part of the book series: Studies in Classification, Data Analysis and Knowledge Organization ((STUDIES CLASS))

  • 540 Accesses

Abstract

One of the problems of metric multidimensional scaling defined by Kruskal’s stress function, is that only convergence to a local minimum is guaranteed. Depending on the dissimilarity data and the chosen dimensionality, many local minima may exist. Here we aim at finding a global minimum of the stress function. Several general methods for global optimization exist, but we shall focus on two. The first one is the tunneling method, proposed by Montalvo (1979) and Gomez and Levy (1982), which aims at finding a decreasing series of local minima. Groenen and Heiser (1991) adapted and applied tunneling to multidimensional scaling. The second method is the multi-level-single-linkage clustering developed by Timmer (1984), which is a stochastic method based on properties of multistart using multiple random starts, and single linkage clustering. An implementation of this method to multidimensional scaling is discussed. Though the two methods aim at finding a global minimum, neither is guaranteed to find it in practice. A comparison is presented of the performance of the two methods in finding the global minima for three data sets. It turns out that both methods arrive at the same candidate global minimum for the three examples.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • De Leeuw, J. (1977), Applications of convex analysis to multidimensional scaling. In: J. Barra et al. (Eds.) Recent developments in statistics, 133–145, Amsterdam: North-Holland.

    Google Scholar 

  • De Leeuw, J. (1988), Convergence of the majorization method for multidimensional scaling. Journal of Classification, 5, 163–180.

    Article  Google Scholar 

  • De Leeuw, J., Heiser, W.J. (1980), Multidimensional scaling with restrictions on the configuration. In: P.R. Krishnaiah (Ed.), Multivariate analysis V, 501–522, Amsterdam: North-Holland.

    Google Scholar 

  • Gomez, S., Levy, A.V. (1982), The tunneling method for solving the constrained global optimization problem with non-connected feasible regions. Lecture notes in mathematics, 909, 34–47, Berlin: Springer-Verlag.

    Google Scholar 

  • Gower, J.C. (1966), Some distance properties of latent roots and vector methods used in multi-variate analysis. Biometrika, 53, 325–338.

    Google Scholar 

  • Groenen, P.J.F., Heiser, W.J. (1991), An improved tunneling function for finding a decreasing series of local minima. Internal report RR-91-06, Leiden: Department of Data Theory.

    Google Scholar 

  • Hartigan, J.A. (1975), Clustering algorithms. New York: Wiley.

    Google Scholar 

  • Hubert, L.J., Arabie, P. (1986), Unidimensional scaling and combinatorial optimization. In: J. De Leeuw, W.J. Heiser, J. Meulman and F. Critchley (Eds.), Multidimensional Data Analysis, 181–196, Leiden: DSWO Press.

    Google Scholar 

  • Ihm, P. (1986). A problem on bacterial taxonomy. Working paper, Euratom: Ispra.

    Google Scholar 

  • Kruskal, J.B. (1964), Nonmetric multidimensional scaling: a numerical method. Psychometrika, 29, 115–129.

    Article  Google Scholar 

  • Levy, A.V., Gomez, S. (1985), The tunneling method applied to global optimization. P.T. Boggs, R.H. Byrd, R.B. Schnabel (Ed.), Numerical optimization 1984, 213–244, Philadelphia: SIAM.

    Google Scholar 

  • Mathar, R. (1989), Algorithms in multidimensional scaling. In: O. Opitz (Ed.), Conceptual and numerical analysis of data, Berlin: Springer Verlag.

    Google Scholar 

  • Mathar, R. (1991), Personal communication.

    Google Scholar 

  • Montalvo, A. (1979), Development of a new algorithm for the global minimization of functions. Ph.D. thesis in Theoretical and applied Mechanics, Universidad Nacional Autonoma de Mexico.

    Google Scholar 

  • Rinnooy Kan, A.H.G., Timmer, G. T. (1987), Stochastic global optimization methods, Part I: clustering methods. Mathematical Programming 39, 27–56.

    Article  Google Scholar 

  • Timmer, G.T. (1984), Global optimization: a stochastic approach. Ph.D. thesis, Rotterdam: Erasmus University.

    Google Scholar 

  • Torgerson, W.S. (1958), Theory and methods of scaling. New-York: Wiley.

    Google Scholar 

  • Törn, A., Ĺ˝ilinskas, A. (1989), Global optimization. G. Goos and J. Hartmanis (Eds.), Lecture notes in computer science, Vol. 350, Berlin: Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Groenen, P.J.F. (1993). A Comparison of Two Methods for Global Optimization in Multidimensional Scaling. In: Opitz, O., Lausen, B., Klar, R. (eds) Information and Classification. Studies in Classification, Data Analysis and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50974-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-50974-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56736-3

  • Online ISBN: 978-3-642-50974-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics