Scalable Euclidean Embedding for Big Data

TitleScalable Euclidean Embedding for Big Data
Publication TypeConference Proceedings
Year of Publication2015
AuthorsZohreh Alavi, Sagar Sharma, Lu Zhou, Keke Chen
Conference Name2015 IEEE 8th International Conference on Cloud Computing
Pagination773 - 780
Date Published07/2015
Conference LocationNew York City, NY
ISSN Number978-1-4673-7286-2
Accession Number15399748
KeywordsAlgorithm design and analysis, Approximation algorithms, arbitrary metric space, Big Data, Big data scale, Complexity theory, data reduction, data visualisation, data visualization, Euclidean embedding algorithms, Euclidean space, FastMap-MR algorithm, LMDS-MR algorithm, massive data parallel infrastructure, Measurement, parallel algorithms, parallel processing, Scalability, scalable Euclidean embedding algorithm, visualization technique

Euclidean embedding algorithms transform data defined in an arbitrary metric space to the Euclidean space, which is critical to many visualization techniques. At big-data scale, these algorithms need to be scalable to massive data-parallel infrastructures. Designing such scalable algorithms and understanding the factors affecting the algorithms are important research problems for visually analyzing big data. We propose a framework that extends the existing Euclidean embedding algorithms to scalable ones. Specifically, it decomposes an existing algorithm into naturally parallel components and non-parallelizable components. Then, data parallel implementations such as MapReduce and data reduction techniques are applied to the two categories of components, respectively. We show that this can be possibly done for a collection of embedding algorithms. Extensive experiments are conducted to understand the important factors in these scalable algorithms: scalability, time cost, and the effect of data reduction to result quality. The result on sample algorithms: Fast Map-MR and LMDS-MR shows that with the proposed approach the derived algorithms can preserve result quality well, while achieving desirable scalability.

Full Text

Assorted Resources: