Eigensolver methods for progressive multidimensional scaling of large data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4372 LNCS, Issue , 2007, Pages 42-53

  Brandes, Ulrik ^a   Pich, Christian ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; NUMERICAL METHODS;

EIGENSOLVER METHODS; LAYOUT ALGORITHM; MULTIDIMENSIONAL SCALING;

DATA PROCESSING;

EID: 38149007264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_6     Document Type: Conference Paper

References (32)

1. W. Basalaj. Incremental multidimensional scaling method for database visualization. In Proc. VDA, pages 149-158, 1999.
2. Y. Bengio, J.-F. Paiement, P. Vincent, O. Delalleau, N. Le Roux, and M. Ouimet. Out-of-sample extensions for LLE, Isomap, MDS, eigenmaps, and spectral clustering. In NIPS, pages 307-311, 2004.
3. I. Borg and P. Groenen. Modern Multidimensional Scaling. Springer, 2005.
4. A. Buja and D. F. Swayne. Visualization methodology for multidimensional scaling. J. Classification, 19:7-43, 2002.
5. C. J. C. Burges. Geometric methods for feature extraction and dimensional reduction. Technical report, Microsoft Research, 2004.
6. M. Chalmers. A linear iteration time layout algorithm for visualizing high-dimensional data. In Proc. InfoVis, pages 127-132. IEEE, 1996.
7. A. Civril, M. Magdon-Ismail, and E. Bocek-Rivele. SDE: Graph drawing using spectral distance embedding. In Proc. Graph Drawing, pages 512-513, 2005.
8. J. D. Cohen. Drawing graphs to convey proximity. ACM Transactions on Computer-Human Interaction, 4(3):197-229, 1997.
9. T. Cox and M. Cox. Multidimensional Scaling. CRC/Chapman and Hall, 2001.
10. V. de Silva and J. Tenenbaum. Global versus local methods in nonlinear dimensionality reduction. In Proc. NIPS, pages 721-728, 2003.
11. C. Faloutsos and K. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia dataseis. In Proc. ACM SIGMOD, pages 163-174, 1995.
12. E.R. Gansner, Y. Koren, and S. North. Graph drawing by stress majorization. In Proc. Graph Drawing, pages 239-250, 2004.
13. G. H. Golub and C. F. van Loan. Matrix computations. Johns Hopkins University Press, 1996.
14. S. Hachul and M. Jünger. An experimental comparison of fast algorithms for drawing general large graphs. In Proc. Graph Drawing, pages 235-250, 2005.
15. D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. In Proc. Graph Drawing, pages 388-393, 2002.
16. F. Jourdan and G. Melançon. Multiscale hybrid MDS. In Proc. IV, pages 388-393. IEEE, 2004.
17. Charles Kadushin. Personal communication.
18. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
19. Y. Koren. Graph drawing by subspace optimization. In Proc. VisSym, pages 65-74, 2004.
20. Y. Koren, L. Carmel, and D. Harel. ACE: A fast multiscale eigenvectors computation for drawing huge graphs. In Proc. InfoVis, pages 137-144. IEEE, 2002.
21. Y. Koren and D. Harel. One-dimensional layout optimization, with applications to graph drawing by axis separation. Computational Geometry: Theory and Applications, 32:115-138, 2005.
22. J. B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a non-metric hypothesis. Psychometrika, 29(1):1-27, 1964.
23. J. B. Kruskal and R. E. Hart. A geometric interpretation of diagnostic data from a digital machine: Based on a study of the Morris, Illinois, Electronic Central Office. Bell Sys. Tech. J., 45(8):1299-1338, 1966.
24. J. B. Kruskal and D. Seery. Designing network diagrams. In Proc. First General Conference on Social Graphics, pages 22-50, 1980.
25. A. Morrison and M. Chalmers. Improving hybrid MDS with pivot-based searching. In Proc. InfoVis, pages 85-90. IEEE, 2003.
26. A. Morrison, G. Ross, and M. Chalmers. A hybrid layout algorithm for subquadratic multidimensional scaling. In Proc. InfoVis, pages 152-158. IEEE, 2002.
27. J. C. Piatt. FastMap, MetricMap, and Landmark MDS are all Nyström Algorithms. Technical report, Microsoft Research, 2004.
28. L. K. Saul, K. Q. Weinberger, J. H. Ham, F. Sha, and D. D. Lee. Spectral methods for dimensionality reduction. In B. Schölkopf, O. Chapelle, and A. Zien, editors, Semi-Supervised Learning. MIT Press, 2006. To appear.
29. J. G. Silva, J. S. Marques, and J. M. Lemos. Selecting landmark points for sparse manifold learning. In Proc. NIPS, 2005.
30. W. S. Torgerson. Multidimensional scaling: I. Theory and Method. Psychometrika, 17:401-419, 1952.
31. J. T.-L. Wang, X. Wang, K. Lin, D. Shasha, B. A. Shapiro, and K. Zhang. Evaluating a class of distance-mapping algorithms for data mining and clustering. In Proc. KDD, pages 307-311, 1999.
32. M. Williams and T. Munzner. Steerable, progressive multidimensional scaling. In Proc. InfoVis, pages 57-64. IEEE, 2004.