CART算法实现之可视化

最新推荐文章于 2023-03-21 17:48:59 发布

Keep_Moving2030

最新推荐文章于 2023-03-21 17:48:59 发布

阅读量1.1k

点赞数

分类专栏：机器学习文章标签： CART 数据挖掘机器学习算法 classifity

本文链接：https://blog.csdn.net/u011982340/article/details/17526907

版权

机器学习专栏收录该内容

4 篇文章 0 订阅

订阅专栏

function filename = viz_tree( tree )
%UNTITLED Summary of this function goes here
% Visualiz the tree using graphviz
global index;
index  = 0;
fid = fopen('Visualization.dot','w+');
fprintf(fid, 'digraph G {\n');
fprintf(fid, 'fontname = "Bitstream Vera Sans"\n');
fprintf(fid, 'fontsize = 8\n');
fprintf(fid, 'node[fontname = "Bitstream Vera Sans"\n');
fprintf(fid, '    fontsize = 8\n');
fprintf(fid, '    shape = "record"]\n');
fprintf(fid, 'edge [fontname = "Bitstream Vera Sans"\n');
fprintf(fid, '      fontsize = 8]\n');
visual( tree ,fid);
fprintf(fid,'}');
fclose(fid);
filename = 'Visualization.dot';

function nodename = visual( tree ,fid)
global index;
index = index + 1;
nodename = ['node' num2str(index)];
if isnumeric(tree.Raction)
   %Reached an end node
   fprintf(fid, '%s[label ="{class = %d|+Error Rate : %5f}"]\n',nodename, tree.Raction(1),tree.Resub);
else
   fprintf(fid, '%s[label ="{Left : %s|+Right : %s|+Alpha : %6f}"]\n',nodename, tree.Laction, tree.Raction, tree.Alpha);
   nl = visual(tree.left, fid);
   nr = visual(tree.right, fid);
   fprintf(fid, '%s -> %s\n',nodename, nl);
   fprintf(fid, '%s -> %s\n',nodename, nr);
   %fprintf(fid, 'nodename[label =%s|+Leafcnt : %d|+Alpha : %6f]\n', tree.Raction, tree.Leafcnt, tree.Alpha);
   %Rl = visual(tree.left, fid);
   %RR = visual(tree.right, fid);
end