Summary
We use several data complexity measures to explain the differences in classification accuracy using various sets of features selected from samples of magnetic resonance spectra for two-class discrimination. Results suggest that for this typical problem with sparse samples in a high-dimensional space, even robust classifiers like random decision forests can benefit from sophisticated feature selection procedures, and the improvement can be explained by the more favorable characteristics in the class geometry given by the resultant feature sets.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Genetic Algorithm
- Feature Selection
- Feature Selection Algorithm
- Candida Parapsilosis
- Dimensionality Reduction Technique
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Bertoni, R. Folgieri, G. Valentini. Bio-molecular cancer prediction with random subspace ensembles of support vector machines. Neurocomputing, 63C, 535–539, 2005.
S. Gunter, H. Bunke. Feature selection algorithms for the generation of multiple classifier systems and their application to handwritten word recognition. Pattern Recognition Letters, 25(11), 1323–1336, 2004.
U. Himmelreich, R.L. Somorjai, B. Dolenko B, et al. Rapid identification of Candida species by using nuclear magnetic resonance spectroscopy and a statistical classification strategy. Applied and Environmental Microbiology 69(8), 4566–4574, 2003.
T.K. Ho. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8), 832–844, 1998.
T.K. Ho. Nearest neighbors in random subspaces. In Proceedings of the 2nd International Workshop on Statistical Techniques in Pattern Recognition, Sydney, Australia, August 11–13, 1998, pages 640–648.
T.K. Ho, M. Basu. Complexity measures of supervised classification problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5), 289–300, 2002.
E.M. Kleinberg. Stochastic Discrimination. Annals of Mathematics and Artificial Intelligence, 1, 207–239, 1990.
C.L. Lean, R.L. Somorjai, I.C.P. Smith, P. Russell, C.E. Mountford. Accurate diagnosis and prognosis of human cancers by proton MRS and a three stage classification strategy. Annual Reports on NMR Spectroscopy 48, 71–111, 2002.
C. Mountford, R. Somorjai, P. Malycha, et al. Diagnosis and prognosis of breast cancer by magnetic resonance spectroscopy of fine-needle aspirates analyzed using a statistical classification strategy. British Journal of Surgery, 88(9), 1234–1240, 2001.
A. Nikulin, B. Dolenko, T. Bezabeh, R. Somorjai. Near optimal region selection for feature space reduction: novel preprocessing methods for classifying MR spectra. NMR in Biomedicine, 11, 209–216, 1998.
S. Raudys, A. Jain. Small sample size effects in statistical pattern recognition: recommendation for practitioners. IEEE Transaction on Pattern Analysis and Machine Intelligence, 13(3), 252–264, 1998.
M. Skurichina, R.P.W. Duin. Bagging, boosting, and the random subspace method for linear classifiers. Pattern Analysis and Applications, 5(2), 121–135, 2002.
R. Somorjai, B. Dolenko, R. Baumgartner. Class prediction and discovery using gene expression and proteomics mass spectroscopy data. Curses, caveats, cautions. Bioinformatics, 19, 1484–1491, 2003.
R. Somorjai, B. Dolenko, A. Nikulin, et al. Distinguishing normal from rejecting renal allografts: application of a three-stage classification strategy to MR and IR spectra of urine. Vibrational Spectroscopy, 28, 97–102, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Verlag London Limited
About this chapter
Cite this chapter
Baumgartner, R., Kam Ho, T., Somorjai, R., Himmelreich, U., Sorrell, T. (2006). Complexity of Magnetic Resonance Spectrum Classification. In: Basu, M., Ho, T.K. (eds) Data Complexity in Pattern Recognition. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-84628-172-3_12
Download citation
DOI: https://doi.org/10.1007/978-1-84628-172-3_12
Publisher Name: Springer, London
Print ISBN: 978-1-84628-171-6
Online ISBN: 978-1-84628-172-3
eBook Packages: Computer ScienceComputer Science (R0)