Genetic Algorithm for Multidimensional Scaling over Mixed and Incomplete Data
Multidimensional scaling maps a set of n-dimensional objects into a lower-dimension space, usually the Euclidean plane, preserving the distances among objects in the original space. Most algorithms for multidimensional scaling have been designed to work on numerical data, but in soft sciences, it is common that objects are described using quantitative and qualitative attributes, even with some missing values. For this reason, in this paper we propose a genetic algorithm especially designed for multidimensional scaling over mixed and incomplete data. Some experiments using datasets from the UCI repository, and a comparison against a common algorithm for multidimensional scaling, shows the behavior of our proposal.
KeywordsMultidimensional scaling Mixed and incomplete data Genetic algorithms
- 6.Faloutsos, C., Lin, K.L.: FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. In: ACM SIGMOD International Conference on Management of Data, pp. 163–174 (1995)Google Scholar
- 12.Merz, C., Murphy, P.: UCI repository of machine learning databases. Technical report, Univ. of California at Irvine, Department of Information and Computer Science (1998)Google Scholar
- 13.Schaffer, J.D., Caruana, A.R., Eshelman, L.J., Das, R.: A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization. In: Proceedings of the Third International Conference on Genetic Algorithms, pp. 51–60. Morgan Kaufmann Publishers, San Mateo (1989)Google Scholar
- 14.Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1992)Google Scholar