High Performance Dimension Reduction and Visualization for Large High-Dimensional Data Analysis

Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining approaches or just for browsing them in a way that distance between points in visualization (2D or 3D) space tracks that in original high dimensional space. Dimension reduction is a well understood approach but can be very time and memory intensive for large problems. Here we report on parallel algorithms for Scaling by MAjorizing a COmplicated Function (SMACOF) to solve Multidimensional Scaling problem and Generative Topographic Mapping (GTM). The former is particularly time consuming with complexity that grows as square of data set size but has advantage that it does not require explicit vectors for dataset points but just measurement of inter-point dissimilarities. We compare SMACOF and GTM on a subset of the NIH PubChem database which has binary vectors of length 166 bits. We find good parallel performance for...

• Type: Conference
• Year: 2010
• Where: CCGRID
• Authors: Jong Youl Choi, Seung-Hee Bae, Xiaohong Qiu, Geoffrey Fox
• Keywords: CCGRID 2010, Distributed And Parallel Computing, Generative Topographic Mapping, Multidimensional Scaling Problem, NIH PubChem Database