Multidimensional Scaling and Genetic Algorithms: A Solution Approach to Avoid Local Minima

Stefan Etschberger and Andreas Hilbert

No 181, Arbeitspapiere zur mathematischen Wirtschaftsforschung from Universität Augsburg, Institut für Statistik und Mathematische Wirtschaftstheorie

Abstract: Multidimensional scaling is very common in exploratory data analysis. It is mainly used to represent sets of objects with respect to their proximities in a low dimensional Euclidean space. Widely used optimization algorithms try to improve the representation via shifting its coordinates in direction of the negative gradient of a corresponding fit function. Depending on the initial configuration, the chosen algorithm and its parameter settings there is a possibility for the algorithm to terminate in a local minimum. This article describes the combination of an evolutionary model with a non-metric gradient solution method to avoid this problem. Furthermore a simulation study compares the results of the evolutionary approach with one classic solution method.

Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/22817/1/Heft181.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:augamw:181

Access Statistics for this paper

More papers in Arbeitspapiere zur mathematischen Wirtschaftsforschung from Universität Augsburg, Institut für Statistik und Mathematische Wirtschaftstheorie Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().