Feature selection and nearest centroid classification for protein mass spectrometry.
BACKGROUND
The use of mass spectrometry as a proteomics tool is poised to revolutionize early disease diagnosis and biomarker identification. Unfortunately, before standard supervised classification algorithms can be employed, the "curse of dimensionality" needs to be solved. Due to the sheer amount of information contained within the mass spectra, most standard machine learning techniques cannot be directly applied. Instead, feature selection techniques are used to first reduce the dimensionality of the input space and thus enable the subsequent use of classification algorithms. This paper examines feature selection techniques for proteomic mass spectrometry.


RESULTS
This study examines the performance of the nearest centroid classifier coupled with the following feature selection algorithms. Student-t test, Kolmogorov-Smirnov test, and the P-test are univariate statistics used for filter-based feature ranking. From the wrapper approaches we tested sequential forward selection and a modified version of sequential backward selection. Embedded approaches included shrunken nearest centroid and a novel version of boosting based feature selection we developed. In addition, we tested several dimensionality reduction approaches, namely principal component analysis and principal component analysis coupled with linear discriminant analysis. To fairly assess each algorithm, evaluation was done using stratified cross validation with an internal leave-one-out cross-validation loop for automated feature selection. Comprehensive experiments, conducted on five popular cancer data sets, revealed that the less advocated sequential forward selection and boosted feature selection algorithms produce the most consistent results across all data sets. In contrast, the state-of-the-art performance reported on isolated data sets for several of the studied algorithms, does not hold across all data sets.


CONCLUSIONS
This study tested a number of popular feature selection methods using the nearest centroid classifier and found that several reportedly state-of-the-art algorithms in fact perform rather poorly when tested via stratified cross-validation. The revealed inconsistencies provide clear evidence that algorithm evaluation should be performed on several data sets using a consistent (i.e., non-randomized, stratified) cross-validation procedure in order for the conclusions to be statistically sound.
Levner
Ilya
I
Department of Computing Science, University of Alberta, Canada. ilya@cs.ualberta.ca
D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D003627:Data Interpretation, Statistical; D030541:Databases, Genetic; D005260:Female; D020869:Gene Expression Profiling; D015972:Gene Expression Regulation, Neoplastic; D006801:Humans; D016247:Information Storage and Retrieval; D008297:Male; D013058:Mass Spectrometry / Q000379:methods*; D008957:Models, Genetic; D015233:Models, Statistical; D016571:Neural Networks, Computer; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods; D010051:Ovarian Neoplasms / Q000175:diagnosis / Q000235:genetics; D010363:Pattern Recognition, Automated; D011471:Prostatic Neoplasms / Q000175:diagnosis / Q000235:genetics; D011506:Proteins / Q000737:chemistry; D040901:Proteomics / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012984:Software; D019032:Spectrometry, Mass, Matrix-Assisted Laser Desorption-Ionization / Q000379:methods*; D013997:Time Factors
D011506:Proteins