arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1005.0530cs.LGcs.AIstat.ML
收藏

基于决策树根连接的特征选择和微阵列数据学习

Feature Selection with Conjunctions of Decision Stumps and Learning from Microarray Data

Centre for Intelligent Machines, McGill University(麦吉尔大学智能机器中心);CHUL Research Center, Laval University(拉瓦尔大学CHUL研究中心)

Mohak Shah, Mario Marchand, Jacques Corbeil

摘要:

设计特征选择学习算法的目标之一是获得依赖于少量属性并具有可验证的未来性能保证的分类器。很少有办法能同时成功地实现这两个目标。性能保证成为关键的任务,如微阵列数据分析,由于非常小的样本量导致有限的经验评估。据我们所知,这样的算法,给理论界的未来表现还没有提出迄今为止的背景下,基因表达数据的分类。在这项工作中,我们研究了在奥卡姆剃刀,样本压缩和PAC-Bayes学习设置中学习决策树的合取(或析取)的前提,用于识别可用于执行可靠分类任务的属性的一个小子集。我们应用所提出的方法从DNA微阵列数据的基因识别,并比较我们的结果,那些众所周知的成功的方法提出的任务。我们表明,我们的算法不仅可以找到基因数量少得多的假设,同时提供有竞争力的分类准确性,而且与其他方法不同,对未来性能有严格的风险保证。所提出的方法是通用的和可扩展的设计新的算法和应用到其他领域。

英文摘要:

One of the objectives of designing feature selection learning algorithms is to obtain classifiers that depend on a small number of attributes and have verifiable future performance guarantees. There are few, if any, approaches that successfully address the two goals simultaneously. Performance guarantees become crucial for tasks such as microarray data analysis due to very small sample sizes resulting in limited empirical evaluation. To the best of our knowledge, such algorithms that give theoretical bounds on the future performance have not been proposed so far in the context of the classification of gene expression data. In this work, we investigate the premise of learning a conjunction (or disjunction) of decision stumps in Occam's Razor, Sample Compression, and PAC-Bayes learning settings for identifying a small subset of attributes that can be used to perform reliable classification tasks. We apply the proposed approaches for gene identification from DNA microarray data and compare our results to those of well known successful approaches proposed for the task. We show that our algorithm not only finds hypotheses with much smaller number of genes while giving competitive classification accuracy but also have tight risk guarantees on future performance unlike other approaches. The proposed approaches are general and extensible in terms of both designing novel algorithms and application to other domains.

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

↑