Random Forest Classification¶
Random forest learning algorithm.
Signals¶
Inputs:
Data
A data set
Preprocessor
Preprocessed data
Outputs:
Learner
A random forest learning algorithm with settings as specified in the dialog.
Random Forest Classifier
A trained classifier.
Description¶
Random forest is a classification technique proposed by (Breiman, 2001). When given a set of class-labeled data, Random Forest builds a set of classification trees. Each tree is developed from a bootstrap sample from the training data. When developing individual trees, an arbitrary subset of attributes is drawn (hence the term “random”), from which the best attribute for the split is selected. Classification is based on the majority vote from individually developed tree classifiers in the forest.
- Specify the name of the learner or classifier. The default name is “Random Forest Classification”.
- Specify how many classification trees will be included in the forest (Number of trees in the forest), and how many attributes will be arbitrarily drawn for consideration at each node. If the latter is not specified (option Consider a number... left unchecked), this number is equal to the square root of the number of attributes in the data.
- Original Brieman’s proposal is to grow the trees without any pre-prunning, but since pre-pruning often works quite well and is faster, the user can set the depth to which the trees will be grown (Limit depth of individual trees). Another pre-pruning option is to select the smallest subset that can be split (Do not split subsets smaller than)
- Produce a report.
- Click Apply to communicate the changes to other widgets. Alternatively, tick the box on the left side of the Apply button and changes will be communicated automatically.
Example¶
The example below shows a comparison schema of a random forest and a tree learner on a specific data set.
