Multigrid multidimensional scaling
Multidimensional scaling (MDS) is a generic name for a family of algorithms that construct a configuration of points in a target metric space from information about inter‐point distances measured in some other metric space. Large‐scale MDS problems often occur in data analysis, representation and vi...
Saved in:
Published in | Numerical linear algebra with applications Vol. 13; no. 2-3; pp. 149 - 171 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Chichester, UK
John Wiley & Sons, Ltd
01.03.2006
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Multidimensional scaling (MDS) is a generic name for a family of algorithms that construct a configuration of points in a target metric space from information about inter‐point distances measured in some other metric space. Large‐scale MDS problems often occur in data analysis, representation and visualization. Solving such problems efficiently is of key importance in many applications.
In this paper we present a multigrid framework for MDS problems. We demonstrate the performance of our algorithm on dimensionality reduction and isometric embedding problems, two classical problems requiring efficient large‐scale MDS. Simulation results show that the proposed approach significantly outperforms conventional MDS algorithms. Copyright © 2006 John Wiley & Sons, Ltd. |
---|---|
Bibliography: | ark:/67375/WNG-DHKQM0Z4-1 The Israel Ministry of Science Infrastrucutre - No. 01-01-499 The European FP 6 NoE - No. 507752 (MUSCLE) istex:7B4F3B92732E8E907BDD7863D5807F0EE155367A The Israel Science Foundation - No. 738/04; No. 48/02 ArticleID:NLA475 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1070-5325 1099-1506 |
DOI: | 10.1002/nla.475 |