On the computation of the geodesic distance with an application to dimensionality reduction in a neuro-oncology problem
Document typeConference report
Rights accessRestricted access - publisher's policy
Manifold learning models attempt to parsimoniously describe multivariate data through a low-dimensional manifold embedded in data space. Similarities between points along this manifold are often expressed as Euclidean distances. Previous research has shown that these similarities are better expressed as geodesic distances. Some problems concerning the computation of geodesic distances along the manifold have to do with time and storage restrictions related to the graph representation of the manifold. This paper provides different approaches to the computation of the geodesic distance and the implementation of Dijkstra’s shortest path algorithm, comparing their performances. The optimized procedures are bundled into a software module that is embedded in a dimensionality reduction method, which is applied to MRS data from human brain tumours. The experimental results show that the proposed implementation explains a high proportion of the data variance with a very small number of extracted features, which should ease the medical interpretation of subsequent results obtained from the reduced datasets.
CitationCruz, R.; Bautista-Villavicencio, D.; Vellido, A. On the computation of the geodesic distance with an application to dimensionality reduction in a neuro-oncology problem. A: Iberoamerican Conference on Pattern Recognition. "Progress in pattern recognition, image analysis, computer vision, and applications: 16th Iberoamerican Congress, CIARP 2011, Pucón, Chile, November 15-18, 2011: proceedings". Pucón: Springer, 2011, p. 483-490.