Analyzing relationships between objects is a pivotal problem within data science. In this context, dimensionality reduction (DR) techniques are employed to generate smaller and more manageable data representations. This paper proposes a new method for dimensionality reduction, based on optimal transportation theory and the Gromov Wasserstein (GW) distance. We offer a new probabilistic view of the classical multidimensional scaling (MDS) algorithm and the nonlinear dimensionality reduction algorithm, Isomap (Isometric mapping or Isometric feature mapping) that extends the classical MDS, in which we use the GW distance between the probability measure of high-dimensional data, and its low-dimensional representation. Through gradient descent, our method embeds high-dimensional data into a lower-dimensional space, providing a robust and efficient solution for analyzing complex high-dimensional datasets.