Skip to main content
Log in

A Permutation-Translation Simulated Annealing Algorithm for L1 and L2 Unidimensional Scaling

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

Given a set of objects and a symmetric matrix of dissimilarities between them, Unidimensional Scaling is the problem of finding a representation by locating points on a continuum. Approximating dissimilarities by the absolute value of the difference between coordinates on a line constitutes a serious computational problem. This paper presents an algorithm that implements Simulated Annealing in a new way, via a strategy based on a weighted alternating process that uses permutations and point-wise translations to locate the optimal configuration. Explicit implementation details are given for least squares loss functions and for least absolute deviations. The weighted, alternating process is shown to outperform earlier implementations of Simulated Annealing and other optimization strategies for Unidimensional Scaling in run time efficiency, in solution quality, or in both.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Murillo, A., Vera, J. & Heiser, W. A Permutation-Translation Simulated Annealing Algorithm for L1 and L2 Unidimensional Scaling. Journal of Classification 22, 119–138 (2005). https://doi.org/10.1007/s00357-005-0008-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00357-005-0008-5

Keywords

Navigation