决策树C4.5实例练习

以下为在网上找的MATLAB实现C4.5的代码

function [tree test_targets] = C4_5(train_patterns, train_targets, test_patterns, inc_node, Nu)

% Classify using Quinlan's C4.5 algorithm
% Inputs:
% 	training_patterns   - Train patterns 行是特征，列是样本
%	training_targets	- Train targets  1行多列，列是训练样本个数
%       test_patterns       - Test  patterns 行是特征，列是样本
%	inc_node            - Percentage of incorrectly assigned samples at a node
%       inc_node为防止过拟合参数，表示样本数小于一定阈值结束递归，可设置为5-10
%       Nu is to determine whether the variable is discrete or continuous (the value is always set to 10)
%
% Outputs
%	test_targets        - Predicted targets 1行m列（列的长度是测试样本的个数）

%NOTE: In this implementation it is assumed that a pattern vector with fewer than 10 unique values (the parameter Nu)
%is discrete, and will be treated as such. Other vectors will be treated as continuous

[Ni, M]	    = size(train_patterns);%输入向量为NI*M的矩阵，其中M表示训练样本个数，Ni为特征维数维数
inc_node    = inc_node*M/100;

%Find which of the input patterns are discrete, and discretisize the corresponding
%dimension on the test patterns
discrete_dim = zeros(1,Ni);
for i = 1