Two-Way Multidimensional Scaling: A Review

被引:69
作者
France, Stephen L. [1 ]
Carroll, J. Douglas [2 ]
机构
[1] Univ Wisconsin, Milwaukee, WI 53201 USA
[2] Rutgers State Univ, Newark, NJ 07102 USA
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS | 2011年 / 41卷 / 05期
关键词
Computational intelligence; data mining; multidimensional scaling (MDS); pattern analysis; visualization; NONLINEAR DIMENSIONALITY REDUCTION; SIMULATED ANNEALING ALGORITHM; GLOBAL OPTIMIZATION; KERNEL PCA; INDIVIDUAL-DIFFERENCES; PROGRAMMING APPROACH; PROXIMITY-MEASURES; FEATURE-EXTRACTION; VISUALIZATION; SIMILARITY;
D O I
10.1109/TSMCC.2010.2078502
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multidimensional scaling (MDS) is a technique used to extract a set of independent variables from a proximity matrix or matrices. Applications of MDS are found in a wide range of areas, including visualization, pattern analysis, data preprocessing, scale development, cybernetics, and localization. The overall rationale behind the paper is to help share innovations across disciplines. We survey and synthesize MDS methods from the academic areas of psychometrics, statistics, and computing. We define classical MDS and distance-based MDS. We then introduce basic MDS formulations and functions. We survey MDS techniques designed for nonlinear data and describe distance-based MDS in terms of minimizing the energy function in a spring system. We describe completely nonmetric MDS techniques for ordinal input data and describe how MDS solutions can be compared using ordinal neighborhood information. We describe optimization methods for fitting MDS models, covering both continuous optimization techniques and combinatorial techniques. We give several illustrative applications of MDS from the areas of cybernetics, air traffic control, molecular chemistry, robotics, and network localization. We link this work to the techniques described in the previous sections of the paper. We list a wide range of currently available MDS software and discuss possible future work in the area.
引用
收藏
页码:644 / 661
页数:18
相关论文
共 165 条
[91]   Nonlinear projection with curvilinear distances: Isomap versus curvilinear distance analysis [J].
Lee, JA ;
Lendasse, A ;
Verleysen, M .
NEUROCOMPUTING, 2004, 57 :49-76
[92]  
LEE JA, P ESANN 2000, P13
[93]   RankVisu: Mapping from the neighborhood network [J].
Lespinats, S. ;
Fertil, B. ;
Villemain, P. ;
Herault, J. .
NEUROCOMPUTING, 2009, 72 (13-15) :2964-2978
[94]   DD-HDS: A method for visualization and exploration of high-dimensional data [J].
Lespinats, Sylvain ;
Verleysen, Michel ;
Giron, Alain ;
Fertil, Bernard .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2007, 18 (05) :1265-1279
[95]  
LI B, P IJCNN 2008, P266
[96]  
LIIV I, 2008, THESIS TALLINN U TEC
[97]  
Lima A, 2004, IEICE T INF SYST, VE87D, P2802
[98]   ON THE LIMITED MEMORY BFGS METHOD FOR LARGE-SCALE OPTIMIZATION [J].
LIU, DC ;
NOCEDAL, J .
MATHEMATICAL PROGRAMMING, 1989, 45 (03) :503-528
[100]  
Michailidis G, 1998, STAT SCI, V13, P307