Distributed Dimension Reduction Algorithms for Widely Dispersed Data

F.N. Abu-Khzam, N.F. Samatova, G. Ostrouchov, M.A. Langston, and G. Al Geist (USA)


Data Mining, Distributed Databases, Information Systems, Parallel and Distributed Algorithms


It is well known that information retrieval, clustering and visualization can often be improved by reducing the dimensionality of high dimensional data. Classical techniques offer optimality but are much too slow for extremely large databases. The problem becomes harder yet when data are distributed across geographically dispersed machines. To address this need, an effective distributed dimension reduction algorithm is developed. Motivated by the success of the serial (non-distributed) FastMap heuristic of Faloutsos and Lin, the distributed method presented here is intended to be fast, accurate and reliable. It runs in linear time and requires very little data transmission. A series of experiments is conducted to gauge how the algorithm’s emphasis on minimal data transmission affects solution quality. Stress function measurements indicate that the distributed algorithm is highly competitive with the original FastMap heuristic.

Important Links:

Go Back