Stratified sampling for feature subspace selection in random forests for high dimensional data

  • Authors:

  • Yunming Ye;Qingyao Wu;Joshua Zhexue Huang;Michael K. Ng;Xutao Li

  • Affiliations:

  • Department of Computer Science, Shenzhen Graduate School, Harbin Institute of Technology, China and Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China;Department of Computer Science, Shenzhen Graduate School, Harbin Institute of Technology, China and Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China;Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, China and Shenzhen Key Laboratory of High Performance Data Mining, China;Department of Mathematics, Hong Kong Baptist University, China;Department of Computer Science, Shenzhen Graduate School, Harbin Institute of Technology, China and Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China

  • Venue:
  • Pattern Recognition
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

For high dimensional data a large portion of features are often not informative of the class of the objects. Random forest algorithms tend to use a simple random sampling of features in building their decision trees and consequently select many subspaces that contain few, if any, informative features. In this paper we propose a stratified sampling method to select the feature subspaces for random forests with high dimensional data. The key idea is to stratify features into two groups. One group will contain strong informative features and the other weak informative features. Then, for feature subspace selection, we randomly select features from each group proportionally. The advantage of stratified sampling is that we can ensure that each subspace contains enough informative features for classification in high dimensional data. Testing on both synthetic data and various real data sets in gene classification, image categorization and face recognition data sets consistently demonstrates the effectiveness of this new method. The performance is shown to better that of state-of-the-art algorithms including SVM, the four variants of random forests (RF, ERT, enrich-RF, and oblique-RF), and nearest neighbor (NN) algorithms.