Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis

被引:108
作者
Chen, Lisha [1 ]
Buja, Andreas [2 ]
机构
[1] Yale Univ, Dept Stat, New Haven, CT 06511 USA
[2] Univ Penn, Wharton Sch, Dept Stat, Philadelphia, PA 19104 USA
关键词
Cluster analysis; Energy functions; Force-directed layout; Isomap; Local linear embedding; Multidimensional scaling; Principal components analysis; Unsupervised learning; VISUALIZATION; EIGENMAPS;
D O I
10.1198/jasa.2009.0111
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
In the past decade there has been a resurgence of interest in nonlinear dimension reduction. Among new proposals are "Local Linear Embedding," "Isomap," and Kernel Principal Components Analysis which all construct global low-dimensional embeddings from local affine or metric information, We introduce a competing method called "Local Multidimensional Scaling" (LMDS). Like LLE, Isomap, and KPCA, LMDS constructs its global embedding from local information, but it uses instead a combination of MDS and "force-directed" graph drawing. We apply the force paradigm to create localized versions of MDS stress functions with a timing parameter to adjust the strength of nonlocal repulsive forces. We solve the problem Of tuning parameter selection with a meta-criterion that measures how well the sets of K-nearest neighbors agree between the data and the embedding. Tuned LMDS seems to be able to outperform MDS, PCA, LLE, Isomap, and KPCA, as illustrated with two well-known image datasets. The meta-criterion can also be used in a pointwise version as a diagnostic tool for measuring the local adequacy of embeddings and thereby detect local problems in dimension reductions.
引用
收藏
页码:209 / 219
页数:11
相关论文
共 33 条
[1]   PARAMAP vs. isomap: A comparison of two nonlinear mapping algorithms [J].
Akkucuk, Ulas ;
Carroll, J. Douglas .
JOURNAL OF CLASSIFICATION, 2006, 23 (02) :221-254
[2]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[3]  
Borg I., 2005, Modern multidimensional scaling: theory and applications
[4]  
Brand M, 2005, LECT NOTES ARTIF INT, V3720, P47, DOI 10.1007/11564096_10
[5]  
Brandes U., 2001, Drawing graphs. Methods and models (Lecture Notes in Computer Science Vol.2025), P71
[6]   Visualization methodology for multidimensional scaling [J].
Buja, A ;
Swayne, DF .
JOURNAL OF CLASSIFICATION, 2002, 19 (01) :7-43
[7]  
BUJA A, 2008, J COMPUTATIONAL GRAP, V17, P1
[8]  
Chen L., 2006, THESIS U PENNSYLVANI
[9]   Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps [J].
Coifman, RR ;
Lafon, S ;
Lee, AB ;
Maggioni, M ;
Nadler, B ;
Warner, F ;
Zucker, SW .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2005, 102 (21) :7426-7431
[10]  
Di Battista G., 1999, Graph drawing: algorithms for the visualization of graphs