Improved version of explainable decision forest: Forest-Based Tree

Document Type : Original Article

Authors

1 Information Systems dept., Faculty of Computers and Information, Menoufia University, Shebin Elkom 32511, Menoufia, Egypt

2 Information System, faculty of computer and information, Menoufia University, Shebin El Kom, Menofia, Egypt

3 Information SystemsDepartment Faculty of Computers and Information Menoufia University, Egypt

Abstract

A Decision Forest is an ensemble learning method that seeks to enhance the predictivity of a single decision tree via training several trees and combining their decisions. However, it is not easy to explain the rationale behind the predictions of decision forests; as each prediction consists of an integration of many decisions. This defect of decision forest makes it a black box, missing interpretable capability, and it will be difficult for humans to understand its entire logic. In this article, we discuss the transformation of the decision forest into a single decision tree, Forest-Based Tree (FBT), without sacrificing accuracy. The proposed method combines the decision rules of individual trees and organizes them into a tree structure. We focus on how to optimize the algorithm; to build an intelligible and lightweight forest-based tree quickly. The open source software for FBT is also provided. Results on 30 UCI datasets show the objective to approximate the predictive performance of the decision forest through forming an explainable decision tree in less computational time.

Keywords