Compressed learning and its applications to subcellular localization

One of the main challenges faced by biological applications is to predict protein subcellular localization in automatic fashion accurately. to achieve this in these applications,a wide variety of machine learning methods have been proposed in recent years. most of them focus on finding the optimal classification scheme and less of them take the simplifying the complexity of biological systems into account. traditionally,such bio-data are analyzed by first performing a feature selection before classification. motivated by cs (compressed sensing) theory,we propose the methodology which performs compressed learning with a sparseness criterion such that feature selection and dimension reduction are merged into one analysis. the proposed methodology decreases the complexity of biological system,while increases protein subcellular localization accuracy. experimental results are quite encouraging,indicating that the aforementioned sparse methods are quite promising in dealing with complicated biological problems,such as predicting the subcellular localization of gram-negative bacterial proteins. © 2011 bentham science publishers ltd.