arrow
返回

Gene selection with guided regularized random forest

delete2013-12-01
delete230
delete
OA
AI
H
Houtao Deng *
G
George C. Runger
DOI:10.1016/j.patcog.2013.05.018delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The regularized random forest (RRF) was recently proposed for feature selection by building only one ensemble. In RRF the features are evaluated on a part of the training data at each tree node. We derive an upper bound for the number of distinct Gini information gain values in a node, and show that many features can share the same information gain at a node with a small number of instances and a large number of features. Therefore, in a node with a small number of instances, RRF is likely to select a feature not strongly relevant. Here an enhanced RRF, referred to as the guided RRF (GRRF), is proposed. In GRRF, the importance scores from an ordinary random forest (RF) are used to guide the feature selection process in RRF. Experiments on 10 gene data sets show that the accuracy performance of GRRF is, in general, more robust than RRF when their parameters change. GRRF is computationally efficient, can select compact feature subsets, and has competitive accuracy performance, compared to RRF, varSelRF and LASSO logistic regression (with evaluations from an RE classifier). Also, RF applied to the features selected by RRF with the minimal regularization outperforms RF applied to all the features for most of the data sets considered here. Therefore, if accuracy is considered more important than the size of the feature subset, RRF with the minimal regularization may be considered. We use the accuracy performance of RF, a strong classifier, to evaluate feature selection methods, and illustrate that weak classifiers are less capable of capturing the information contained in a feature subset. Both RRF and GRRF were implemented in the RRF R package available at CRAN, the official R package archive. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Classification
Feature selection
Random forest
Variable selection
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

A
Arizona State University
学者数:
2.7W
论文数: 2.5W
被引数: 4.2W
I
intuit inc.
学者数:
12
论文数: 9
被引数: 0
引用论文

引用论文

Local structural change in GaCrN grown by radio frequency plasma-assisted molecular-beam epitaxy
err2004-12-01
err0
PREAI
errM. Hashimoto; H. Tanaka; S. Emura; M.S. Kim; T. Honma; N. Umesaki; Y.K. Zhou; S. Hasegawa; H. Asahi
err分享
err收藏
Rasch Models for Measurement
err
IF0
err1988-01-01
err0
PREAI
errDavid Andrich
err分享
err收藏
Markov blanket-embedded genetic algorithm for gene selection
err2007-11-01
err324
PREAI
errZhu, Zexuan; Ong, Yew-Soon; Dash, Manoranjan
err分享
err收藏
5GNOW: Challenging the LTE Design Paradigms of Orthogonality and Synchronicity
err2013-06-01
err0
errOAAI
errGerhard Wunder; Martin Kasparick; Stephan ten Brink; Frank Schaich; Thorsten Wild; Ivan Gaspar; Eckhard Ohlmer; Stefan Krone; Nicola Michailow; Ainoa Navarro; Gerhard Fettweis; Dimitri Ktenas; Vincent Berg; Marcin Dryjanski; Slawomir Pietrzyk; Bertalan Eged
err分享
err收藏
学者 查看更多内容