Browse > Article

Non-Metric Multidimensional Scaling using Simulated Annealing  

Lee, Chang-Yong (공주대학교 산업시스템공학과)
Lee, Dong-Ju (공주대학교 산업시스템공학과)
Abstract
The non-metric multidimensional scaling (nMDS) is a method for analyzing the relation among objects by mapping them onto the Euclidean space. The nMDS is useful when it is difficult to use the concept of distance between pairs of objects due to non-metric dissimilarities between objects. The nMDS can be regarded as an optimization problem in which there are many local optima. Since the conventional nMDS algorithm utilizes the steepest descent method, it has a drawback in that the method can hardly find a better solution once it falls into a local optimum. To remedy this problem, in this paper, we applied the simulated annealing to the nMDS and proposed a new optimization algorithm which could search for a global optimum more effectively. We examined the algorithm using benchmarking problems and found that improvement rate of the proposed algorithm against the conventional algorithm ranged from 0.7% to 3.2%. In addition, the statistical hypothesis test also showed that the proposed algorithm outperformed the conventional one.
Keywords
Non-metric multidimensional scaling; simulated annealing; pure nMDS; global optimum; random network;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. L. Leung and K. Lau, "Estimating the cityblock two-dimensional scaling model with simulated annealing," European Journal of Operational Research, vol.158, pp.518-524, 2004.   DOI   ScienceOn
2 A. Zilinskas and J. Zilinskas, "On Multidimensional Scaling with Euclidean and City Block Metrics," Okio Technologinis Ir Ekonominis Vystymas, pp.69-75, 2006.
3 S. W. Malone, P. Tarazaga, and M. W. Trosset, "Better initial configurations for metric multidimensional scaling," Computational Statistics & Data Analysis, vol.41, pp.143-156, 2002.   DOI   ScienceOn
4 박기용, 안성식, 정기용, "다차원척도법을 이용한 외식 기업 경쟁요인 비교분석에 관한 연구", 외식경영학회, vol.9, pp.93-114, 2006.
5 김철수, 정병두, 이원수, "공동주택 외부공간의 주거만족도 분석", 국토연구, vol.53, pp.277-294, 2007.
6 D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, New York, IEEE Press, 1995.
7 S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol.220, pp.671-680, 1983.   DOI   ScienceOn
8 N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equation of state calculations for fast computing landscape," J. Chem. Phys., vol.2, pp.1087-1093, 1953.
9 M. Newman, "The structure and function of complex networks," SIAM Rev., vol.45, pp.167-256, 2003.   DOI   ScienceOn
10 L. Chao, Statistics: Methods and Analyses, McGraw-Hill, N.Y., 1966.
11 J. Lattin et al, Analyzing Multivariate Data, Thomson, Nelson, 2003.
12 J. Kruskal "Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis," Psychometrika, vol.29, pp.1-27, 1964.   DOI
13 J. Kruskal "Nonmetric Multidimensional Scaling," Psychometrika, vol.29, pp.115-129, 1964.   DOI
14 Y. H. Taguchi, and Y. Oono, "Relational patterns of gene expression via non-metric multidimensional scaling analysis," Bioinformatics, vol.21, pp. 730-740, 2005.   DOI   ScienceOn
15 M. Garey and D. Johnson, Computers and Intractability: A Guide to the theory of NP-completeness, New York, W. H. Freeman, 1979.
16 I. Shmulevich and W. Zhang, "Binary analysis and optimization-based normalization of gene expression data," Bioinformatics, vol.18, pp.555-565, 2002.   DOI   ScienceOn
17 R. Shepard "The analysis of Proximities: Multidimensional Scaling with an unknown Distance Function," Psychometrika, vol.27, pp.125-140, 1962.   DOI