arXiv · 1505.06249
Greedy Biomarker Discovery in the Genome with Applications to Antimicrobial Resistance
Abstract
The Set Covering Machine (SCM) is a greedy learning algorithm that produces sparse classifiers. We extend the SCM for datasets that contain a huge number of features. The whole genetic material of living organisms is an example of such a case, where the number of feature exceeds 10^7. Three human pathogens were used to evaluate the performance of the SCM at predicting antimicrobial resistance. Our results show that the SCM compares favorably in terms of sparsity and accuracy against L1 and L2 regularized Support Vector Machines and CART decision trees. Moreover, the SCM was the only algorithm that could consider the full feature space. For all other algorithms, the latter had to be filtered as a preprocessing step.
Explore related subjects
Keep this discovery
Alexandre Drouin, Sébastien Giguère, Maxime Déraspe, François Laviolette, Mario Marchand, Jacques Corbeil. 2015-05-22. Greedy Biomarker Discovery in the Genome with Applications to Antimicrobial Resistance. https://arxiv.org/abs/1505.06249
Cite the original work for its findings. Save a collection to share your selection of sources.