Comparative Diagnostic Accuracy of Linear and Nonlinear Feature Extraction Methods in a Neuro-oncology Problem
The diagnostic classification of human brain tumours on the basis of magnetic resonance spectra is a non-trivial problem in which dimensionality reduction is almost mandatory. This may take the form of feature selection or feature extraction. In feature extraction using manifold learning models, multivariate data are described through a low-dimensional manifold embedded in data space. Similarities between points along this manifold are best expressed as geodesic distances or their approximations. These approximations can be computationally intensive, and several alternative software implementations have been recently compared in terms of computation times. The current brief paper extends this research to investigate the comparative ability of dimensionality-reduced data descriptions to accurately classify several types of human brain tumours. The results suggest that the way in which the underlying data manifold is constructed in nonlinear dimensionality reduction methods strongly influences the classification results.
KeywordsLinear Discriminant Analysis Geodesic Distance Human Brain Tumour Short Path Algorithm Nonlinear Dimensionality Reduction
- 8.Bautista-Villavicencio, D., Cruz-Barbosa, R.: On geodesic distance computation: An experimental study. Advances in Computer Science and Applications, Research in Computing Science 53, 115–124 (2011)Google Scholar
- 9.Bernstein, M., de Silva, V., Langford, J.C., Tenenbaum, J.B.: Graph approximations to geodesics on embedded manifolds. Technical report, Stanford University, CA, U.S.A (2000)Google Scholar