arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.4525cs.LGq-bio.QM
收藏

基于随机森林的基因选择方法的鲁棒性

Robustness of Random Forest-based gene selection methods

Interdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw(华沙大学跨学科数学与计算建模中心)

Miron B. Kursa

摘要:

基因选择是微阵列数据分析的重要组成部分,因为它提供的信息可以导致更好地理解所研究的现象。同时,由于微阵列数据的噪声性质,基因选择非常困难。因此,基因选择通常用机器学习方法来执行。随机森林方法特别适合于此目的。在这项工作中,四个国家的最先进的随机森林为基础的特征选择方法进行了比较,在基因选择的上下文中。分析的重点是选择的稳定性,因为,虽然它是必要的,以确定结果的意义,它往往被忽视,在类似的研究。随机森林分类器的验证中的选择后准确度的比较显示,在这种情况下,所有研究的方法是等效的。然而,这些方法在选择基因的数量和选择的稳定性方面存在很大差异。在分析的方法中,Boruta算法预测了大多数潜在重要的基因。选择后分类器的出错率,这是一个经常使用的措施,被发现是一个潜在的欺骗性的基因选择质量的措施。当考虑到一致选择的基因的数量时,Boruta算法显然是最好的。虽然它也是计算量最大的方法,但Boruta算法的计算需求可以通过将随机森林的重要性替换为来自随机蕨类(一种类似但简化的分类器)的可比度量来降低到与其他算法相当的水平。尽管他们的设计假设,最小的最优选择方法,被发现选择一个高比例的假阳性。

英文摘要:

Gene selection is an important part of microarray data analysis because it provides information that can lead to a better mechanistic understanding of an investigated phenomenon. At the same time, gene selection is very difficult because of the noisy nature of microarray data. As a consequence, gene selection is often performed with machine learning methods. The Random Forest method is particularly well suited for this purpose. In this work, four state-of-the-art Random Forest-based feature selection methods were compared in a gene selection context. The analysis focused on the stability of selection because, although it is necessary for determining the significance of results, it is often ignored in similar studies. The comparison of post-selection accuracy in the validation of Random Forest classifiers revealed that all investigated methods were equivalent in this context. However, the methods substantially differed with respect to the number of selected genes and the stability of selection. Of the analysed methods, the Boruta algorithm predicted the most genes as potentially important. The post-selection classifier error rate, which is a frequently used measure, was found to be a potentially deceptive measure of gene selection quality. When the number of consistently selected genes was considered, the Boruta algorithm was clearly the best. Although it was also the most computationally intensive method, the Boruta algorithm's computational demands could be reduced to levels comparable to those of other algorithms by replacing the Random Forest importance with a comparable measure from Random Ferns (a similar but simplified classifier). Despite their design assumptions, the minimal optimal selection methods, were found to select a high fraction of false positives.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑