An improved decision tree algorithm based on boundary mixed attribute dependency

doi:10.1007/s10489-023-05238-4

Return

An improved decision tree algorithm based on boundary mixed attribute dependency

2024-01-30

PRE

DOI：10.1007/s10489-023-05238-4

Original

Original request for help

Save

Abstract

En 中文

As an effective extension of rough set theory, the variable precision neighborhood rough set model has been applied to the attribute dependency-based improvement of decision tree algorithm of the solution concerning continuous data. However, the boundary region, as an effective description of the uncertainty of knowledge, has not been taken into account in the existing algorithms. In this paper, we define a novel decision rule based on boundary region and attribute dependency, and construct a decision tree algorithm via this decision rule. First, we define a measure called boundary coefficient based on the boundary region, which can be used for comparative quantitative analysis. Second, we define the boundary mixed attribute dependency by combining the boundary coefficient and the attribute dependency, which can consider both the boundary case of the target set and the attribute dependency. Finally, a novel decision tree algorithm is proposed by using the boundary mixed attribute dependency as the decision rule. The experimental results show that with a slight increase in leaf nodes, the total running time decreases and the maximum accuracy increases to 0.9518, which indicates the effectiveness of the proposed algorithm.

Keywords:

Decision tree algorithm

Neighborhood similarity

Variable precision neighborhood rough sets

Boundary coefficient

Boundary mixed attribute dependency