基因组中贪婪的生物标志物发现及其在抗生素耐药性研究中的应用
Greedy Biomarker Discovery in the Genome with Applications to Antimicrobial Resistance
摘要:
集合覆盖机(SCM)是一种产生稀疏分类器的贪婪学习算法。我们扩展SCM的数据集,包含大量的功能。生物体的全部遗传物质就是这样一个例子,其特征数超过10^7。使用三种人类病原体来评估SCM在预测抗菌素耐药性方面的性能。我们的结果表明,与L1和L2正则化支持向量机和CART决策树相比,SCM在稀疏性和准确性方面具有优势。此外,SCM是唯一可以考虑全特征空间的算法。对于所有其他算法,后者必须作为预处理步骤进行过滤。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。