Dimension reduction and visualization of large high-dimensional data via interpolation

HPDC 2010 - Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing

Volumn , Issue , 2010, Pages 203-214

  Bae, Seung Hee ^a   Choi, Jong Youl ^a   Qiu, Judy ^a   Fox, Geoffrey C ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

GTM; Interpolation; MDS

Indexed keywords

COMPUTATIONAL RESOURCES; DATA ANALYSIS; DATA POINTS; DIMENSION REDUCTION; DIMENSION REDUCTION ALGORITHM; GENE SEQUENCES; GENERATIVE TOPOGRAPHIC MAPPING; GTM; HIGH DIMENSIONAL DATA; HIGH EFFICIENCY; HIGH-DIMENSIONAL; INTERPOLATION ALGORITHMS; INTERPOLATION METHOD; LARGE HIGH-DIMENSIONAL DATA; MDS; MEMORY REQUIREMENTS; MULTI-DIMENSIONAL SCALING; ORIGINAL ALGORITHMS; PARALLEL MECHANISMS; PARALLEL PERFORMANCE; PERFORMANCE DIMENSIONS; PHYSICAL MEMORY; SAMPLE DATA; SCIENTIFIC DATA; STRESS CRITERION; THREE DIMENSIONAL VISUALIZATION;

ALGORITHMS; CHEMICAL COMPOUNDS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; INTERPOLATION; MECHANISMS; THREE DIMENSIONAL COMPUTER GRAPHICS; VISUALIZATION;

DATA VISUALIZATION;

EID: 78650015538     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1851476.1851501     Document Type: Conference Paper

References (24)

1. D. Aloise, A. Deshpande, P. Hansen, and P. Popat. NP-hardness of Euclidean sum-of-squares clustering. Machine Learning, 75(2):245-248, 2009.
2. Y. Bengio, J.-F. Paiement, P. Vincent, O. Delalleau, N. L. Roux, and M. Ouimet. Out-of-sample extensions for lle, isomap, mds, eigenmaps, and spectral clustering. In Advances in Neural Information Processing Systems, pages 177-184. MIT Press, 2004.
3. C. Bishop, M. Svensén, and C. Williams. GTM: A principled alternative to the self-organizing map. Advances in neural information processing systems, pages 354-360, 1997.
4. C. Bishop, M. Svensén, and C. Williams. GTM: The generative topographic mapping. Neural computation, 10(1):215-234, 1998.
5. I. Borg and P. J. Groenen. Modern Multidimensional Scaling: Theory and Applications. Springer, New York, NY, U.S.A., 2005.
6. M. Carreira-Perpinán and Z. Lu. The laplacian eigenmaps latent variable model. In Proc. of the 11th Int. Workshop on Artificial Intelligence and Statistics (AISTATS 2007). Citeseer, 2007.
7. J. Y. Choi, S.-H. Bae, X. Qiu, and G. Fox. High performance dimension reduction and visualization for large high-dimensional data analysis. In Proceedings of the 10th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2010), May 2010.
8. T. M. Cover and P. E. Hart. Nearest neighbor pattern classification. IEEE Transaction on Information Theory, 13(1):21-27, 1967.
9. J. de Leeuw. Applications of convex analysis to multidimensional scaling. Recent Developments in Statistics, pages 133-145, 1977.
10. J. de Leeuw. Convergence of the majorization method for multidimensional scaling. Journal of Classification, 5(2):163-180, 1988.
11. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B, pages 1-38, 1977.
12. G. Fox, S. Bae, J. Ekanayake, X. Qiu, and H. Yuan. Parallel data mining from multicore to cloudy grids. In Proceedings of HPC 2008 High Performance Computing and Grids workshop, Cetraro, Italy, July 2008.
13. G. Fox, S. Otto, and A. Hey. Matrix algorithms on a hypercube I: Matrix multiplication. Parallel computing, 4(1):17-31, 1987.
14. S. Ingram, T. Munzner, and M. Olano. Glimmer: Multilevel mds on the gpu. IEEE Transactions on Visualization and Computer Graphics, 15(2):249-261, 2009.
15. A. Kaban. A scalable generative topographic mapping for sparse data sequences. In Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05)-Volume I, pages 51-56. Citeseer, 2005.
16. T. Kohonen. The self-organizing map. Neurocomputing, 21(1-3):1-6, 1998.
17. J. B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29(1):1-27, 1964.
18. J. B. Kruskal and M. Wish. Multidimensional Scaling. Sage Publications Inc., Beverly Hills, CA, U.S.A., 1978.
19. Y. Takane, F. W. Young, and J. de Leeuw. Nonmetric individual differences multidimensional scaling: an alternating least squares method with optimal scaling features. Psychometrika, 42(1):7-67, 1977.
20. W. S. Torgerson. Multidimensional scaling: I. theory and method. Psychometrika, 17(4):401-419, 1952.
21. M. W. Trosset and C. E. Priebe. The out-of-sample problem for classical multidimensional scaling. Computational Statistics and Data Analysis, 52(10):4635-4642, 2008.
22. R. Van De Geijn and J. Watts. SUMMA: Scalable universal matrix multiplication algorithm. Concurrency Practice and Experience, 9(4):255-274, 1997.
23. Z. Wang, S. Zheng, Y. Ye, and S. Boyd. Further relaxations of the semidefinite programming approach to sensor network localization. SIAM Journal on Optimization, 19(2):655-673, 2008.
24. S. Xiang, F. Nie, Y. Song, C. Zhang, and C. Zhang. Embedding new data points for manifold learning via coordinate propagation. Knowledge and Information Systems, 19(2):159-184, 2009.