Multidimensional Scaling and Genetic Algorithms : A Solution Approach to Avoid Local Minima
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.
Year of publication: |
2002
|
---|---|
Authors: | Etschberger, Stefan ; Hilbert, Andreas |
Institutions: | Fakultät für Wirtschaftswissenschaften, Universität Augsburg |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Data Mining Projekte im unternehmerischen Umfeld : eine empirische Studie deutscher Unternehmen
Hilbert, Andreas, (2002)
-
Hilbert, Andreas, (2002)
-
Multidimensional Scaling and Genetic Algorithms : A Solution Approach to Avoid Local Minima
Etschberger, Stefan, (2002)
- More ...