fourth_node.m

来自「数据挖掘里的判定树算法」· M 代码 · 共 16 行

income3;
student3;
credit_rating3;
% if G_age>=G_income
    Gain=G_income;
% else
%     Gain=G_income;
% end
if Gain<G_student
    Gain=G_student;
elseif Gain<G_credit_rating
    Gain=G_credit_rating;
end
disp(sprintf('第四个节点选为信息增益为：%d的节点',Gain));
% disp('所以该节点为叶子节点');