Unknown

Dataset Information

0

Splitting on categorical predictors in random forests.


ABSTRACT: One reason for the widespread success of random forests (RFs) is their ability to analyze most datasets without preprocessing. For example, in contrast to many other statistical methods and machine learning approaches, no recoding such as dummy coding is required to handle ordinal and nominal predictors. The standard approach for nominal predictors is to consider all 2 k - 1 - 1 2-partitions of the k predictor categories. However, this exponential relationship produces a large number of potential splits to be evaluated, increasing computational complexity and restricting the possible number of categories in most implementations. For binary classification and regression, it was shown that ordering the predictor categories in each split leads to exactly the same splits as the standard approach. This reduces computational complexity because only k - 1 splits have to be considered for a nominal predictor with k categories. For multiclass classification and survival prediction no ordering method producing equivalent splits exists. We therefore propose to use a heuristic which orders the categories according to the first principal component of the weighted covariance matrix in multiclass classification and by log-rank scores in survival prediction. This ordering of categories can be done either in every split or a priori, that is, just once before growing the forest. With this approach, the nominal predictor can be treated as ordinal in the entire RF procedure, speeding up the computation and avoiding category limits. We compare the proposed methods with the standard approach, dummy coding and simply ignoring the nominal nature of the predictors in several simulation settings and on real data in terms of prediction performance and computational efficiency. We show that ordering the categories a priori is at least as good as the standard approach of considering all 2-partitions in all datasets considered, while being computationally faster. We recommend to use this approach as the default in RFs.

SUBMITTER: Wright MN 

PROVIDER: S-EPMC6368971 | biostudies-literature | 2019

REPOSITORIES: biostudies-literature

altmetric image

Publications

Splitting on categorical predictors in random forests.

Wright Marvin N MN   König Inke R IR  

PeerJ 20190207


One reason for the widespread success of random forests (RFs) is their ability to analyze most datasets without preprocessing. For example, in contrast to many other statistical methods and machine learning approaches, no recoding such as dummy coding is required to handle ordinal and nominal predictors. The standard approach for nominal predictors is to consider all 2 <sup><i>k</i> - 1</sup> - 1 2-partitions of the <i>k</i> predictor categories. However, this exponential relationship produces a  ...[more]

Similar Datasets

| S-EPMC6369914 | biostudies-literature
| S-EPMC9875945 | biostudies-literature
| S-EPMC4142736 | biostudies-other
| S-EPMC6051549 | biostudies-literature
| S-EPMC2889677 | biostudies-literature
| S-EPMC4173102 | biostudies-literature
| S-EPMC5074325 | biostudies-literature
| S-EPMC8683425 | biostudies-literature
| S-EPMC3530909 | biostudies-literature
| S-EPMC8716055 | biostudies-literature