bestsubtrainspace.m

来自「一个朴素贝叶斯的matlab实现算法一个朴素贝叶斯的matlab实现算法」· M 代码 · 共 21 行

%输入Trainset
%输出10次选择后的SubTrainSet和Del
function [SubTrainSet Del]=bestSubTrainSpace(TrainSet)
[SubTrain Validate]=randExtraSplitT(TrainSet,10);
f={};
best={};
for i=1:3
    best{i}=0;
end
for i=1:10
  
    [a b c]=subTrainSpace(SubTrain,Validate);
    f{i}{1}=a;
    f{i}{2}=b;
    f{i}{3}=c;
    if(f{i}{3}>best{3})
        best=f{i};
    end
end
SubTrainSet=best{1};
Del=best{2};