.png){kind=icon}
返回
An improved ID3 algorithm based on variable precision neighborhood rough sets
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-023-04779-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The classical ID3 decision tree algorithm cannot directly handle continuous data and has a poor classification effect. Moreover, most of the existing approaches use a single mechanism for node measurement, which is unfavorable for the construction of decision trees. In order to solve the above problems, we propose an improved ID3 algorithm (called DIGGI) based on variable precision neighborhood rough sets. First, we introduce the notions of variable precision neighborhood (VPN) equivalence relation and VPN equivalence granule, and probe some basic properties of these notions. Second, we give the model of VPN rough sets and propose two extended measures: the VPN information gain and the VPN Gini index. Finally, we construct a hybrid measure by using the VPN dependence to combine the above two extended measures, and adopt the VPN equivalence granule as the splitting rule of DIGGI. Experimental results show that DIGGI is effective and its accuracy is greatly improved compared with three traditional decision tree algorithms, the neighborhood decision tree (NDT) and variable precision neighborhood decision tree (VPNDT) proposed in the latest literature.
Keyword:
Variable precision neighborhood rough sets
Decision tree
Attribute dependence
Uncertainty measure
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
The influence of various precursors on solar-light-driven g-C3N4 synthesis and its effect on photocatalytic tetracycline hydrochloride (TCH) degradation各种前体对太阳光驱动的g-C3N4合成及其对光催化盐酸四环素 (TCH) 降解的影响
PREAI
分享收藏分享收藏Bacteriocins and their applications for the treatment of bacterial diseases in aquaculture: a review
OAAI
OAAI分享收藏
查看更多内容