We propose here a parallel implementation of multidimensional scaling (MDS) method which can be used for visualization of large datasets of multidimensional data. Unlike in traditional approaches, which employ classical minimization methods for finding the global optimum of the "stress function", we use a heuristic based on particle dynamics. This method allows avoiding local minima and is convergent to the global one. However, due to its O(N 2) complexity, the application of this method in data mining problems involving large datasets requires efficient parallel codes. We show that employing both optimized Taylor's algorithm and hybridized model of parallel computations, our solver is efficient enough to visualize multidimensional data sets consisting of 104 feature vectors in time of minutes. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Pawliczek, P., & Dzwinel, W. (2010). Parallel implementation of multidimensional scaling algorithm based on particle dynamics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6067 LNCS, pp. 312–321). https://doi.org/10.1007/978-3-642-14390-8_32
Mendeley helps you to discover research relevant for your work.