Pruning trees in C-fuzzy random forest
- PDF / 727,188 Bytes
- 19 Pages / 595.276 x 790.866 pts Page_size
- 21 Downloads / 265 Views
METHODOLOGIES AND APPLICATION
Pruning trees in C-fuzzy random forest Łukasz Gadomer1 · Zenon A. Sosnowski1
© The Author(s) 2020
Abstract Pruning decision trees is the way to decrease their size in order to reduce classification time and improve (or at least maintain) classification accuracy. In this paper, the idea of applying different pruning methods to C-fuzzy decision trees and Cluster– context fuzzy decision trees in C-fuzzy random forest is presented. C-fuzzy random forest is a classifier which we created and we are improving. This solution is based on fuzzy random forest and uses C-fuzzy decision trees or Cluster–context fuzzy decision trees—depending on the variant. Five pruning methods were adjusted to mentioned kind of trees and examined: Reduced Error Pruning (REP), Pessimistic Error Pruning (PEP), Minimum Error Pruning (MEP), Critical Value Pruning (CVP) and Cost-Complexity Pruning. C-fuzzy random forests with unpruned trees and trees constructed using each of these pruning methods were created. The evaluation of created forests was performed on eleven discrete decision class datasets (forest with C-fuzzy decision trees) and two continuous decision class datasets (forest with Cluster–context fuzzy decision trees). The experiments on eleven different discrete decision class datasets and two continuous decision class datasets were performed to evaluate five implemented pruning methods. Our experiments show that pruning trees in C-fuzzy random forest in general reduce computation time and improve classification accuracy. Generalizing, the best classification accuracy improvement was achieved using CVP for discrete decision class problems and REP for continuous decision class datasets, but for each dataset different pruning methods work well. The method which pruned trees the most was PEP and the fastest one was MEP. However, there is no pruning method which fits the best for all datasets—the pruning method should be chosen individually according to the given problem. There are also situations where it is better to remain trees unpruned. Keywords C-fuzzy random forest · Pruning · C-fuzzy decision tree · Cluster–context fuzzy decision tree
1 Introduction Decision trees created during learning process are often overgrown. They meet the problem of overfitting to the training dataset—some nodes are created to fit the single objects of this dataset and they seem to be redundant. The existence of such nodes distort the power of generalization which should characterize the classifier. It also extends a classification time, which is especially important in large trees. While working with our classifier—C-fuzzy random forest—we met the same problem. We noticed that C-fuzzy Communicated by V. Loia.
B
Zenon A. Sosnowski [email protected] Łukasz Gadomer [email protected]
1
Faculty of Computer Science, Bialystok University of Technology, Białystok, Poland
decision trees and Cluster–context fuzzy decision trees which are the part of created forest are too large and overfitted to training dataset. The objec
Data Loading...
