CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2010 vol.7 Issue No.03 - July-September

Subscribe

Issue No.03 - July-September (2010 vol.7)

pp: 537-549

Xiaoxu Han , Eastern Michgan University, Ypsilanti

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2009.36

ABSTRACT

As a well-established feature selection algorithm, principal component analysis (PCA) is often combined with the state-of-the-art classification algorithms to identify cancer molecular patterns in microarray data. However, the algorithm's global feature selection mechanism prevents it from effectively capturing the latent data structures in the high-dimensional data. In this study, we investigate the benefit of adding nonnegative constraints on PCA and develop a nonnegative principal component analysis algorithm (NPCA) to overcome the global nature of PCA. A novel classification algorithm NPCA-SVM is proposed for microarray data pattern discovery. We report strong classification results from the NPCA-SVM algorithm on five benchmark microarray data sets by direct comparison with other related algorithms. We have also proved mathematically and interpreted biologically that microarray data will inevitably encounter overfitting for an SVM/PCA-SVM learning machine under a Gaussian kernel. In addition, we demonstrate that nonnegative principal component analysis can be used to capture meaningful biomarkers effectively.

INDEX TERMS

Biomarker discovery, classification, feature selection, overfitting.

CITATION

Xiaoxu Han, "Nonnegative Principal Component Analysis for Cancer Molecular Pattern Discovery",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.7, no. 3, pp. 537-549, July-September 2010, doi:10.1109/TCBB.2009.36REFERENCES