arrow
Return

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
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

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.
Keywords:
Classification
Feature selection
Random forest
Variable selection
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

A
Arizona State University
Scholars:
2.7W
Papers: 2.5W
Citations: 4.2W
I
intuit inc.
Scholars:
12
Papers: 9
Citations: 0
Cited Papers

Cited Papers

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
errShare
errSave
Rasch Models for Measurement
err
IF0
err1988-01-01
err0
PREAI
errDavid Andrich
errShare
errSave
Markov blanket-embedded genetic algorithm for gene selection
err2007-11-01
err324
PREAI
errZhu, Zexuan; Ong, Yew-Soon; Dash, Manoranjan
errShare
errSave
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
errShare
errSave
Gene selection for cancer classification using support vector machines
err2002-01-01
err7.5K
errOAAI
errGuyon, I; Weston, J; Barnhill, S; Vapnik, V
errShare
errSave
researcher View more