Laplacian-Weighted Random Forest for High-Dimensional Data Classification

Author(s):  
Jianheng Liang ◽  
Dong Huang
2012 ◽  
Vol 8 (2) ◽  
pp. 44-63 ◽  
Author(s):  
Baoxun Xu ◽  
Joshua Zhexue Huang ◽  
Graham Williams ◽  
Qiang Wang ◽  
Yunming Ye

The selection of feature subspaces for growing decision trees is a key step in building random forest models. However, the common approach using randomly sampling a few features in the subspace is not suitable for high dimensional data consisting of thousands of features, because such data often contains many features which are uninformative to classification, and the random sampling often doesn’t include informative features in the selected subspaces. Consequently, classification performance of the random forest model is significantly affected. In this paper, the authors propose an improved random forest method which uses a novel feature weighting method for subspace selection and therefore enhances classification performance over high-dimensional data. A series of experiments on 9 real life high dimensional datasets demonstrated that using a subspace size of features where M is the total number of features in the dataset, our random forest model significantly outperforms existing random forest models.


2004 ◽  
Vol 20 (7) ◽  
pp. 1131-1143 ◽  
Author(s):  
Yang-Lang Chang ◽  
Chin-Chuan Han ◽  
Fan-Di Jou ◽  
Kuo-Chin Fan ◽  
K.S. Chen ◽  
...  

2018 ◽  
Vol 12 (4) ◽  
pp. 953-972 ◽  
Author(s):  
Qiang Wang ◽  
Thanh-Tung Nguyen ◽  
Joshua Z. Huang ◽  
Thuy Thi Nguyen

Sign in / Sign up

Export Citation Format

Share Document