67 CaseCount Cases=0, KnownCases, BranchCases, MissingCases;
82 Missing = (Ep =
Group(0, Fp, Lp, T)) - Fp + 1;
91 MissingCases = CountCases(Fp, Ep);
92 KnownCases = Cases - MissingCases;
103 Ep =
Group(v, Bp + Missing, Lp, T);
108 BranchCases = CountCases(Bp + Missing, Ep);
110 Factor = ( ! Missing ? 0 :
114 if ( BranchCases + Factor * MissingCases >= MinLeaf )
118 ForEach(i, Bp, Bp + Missing - 1)
132 for ( i = Ep ; i >= Bp ; i-- )
168 CaseNo i, j, Kp, Bp, Ap, Missing, SplitI;
179 Kp =
Group(0, Fp, Lp, T) + 1;
183 KnownCases = CountCases(Kp, Lp);
189 Verbosity(1, fprintf(
Of,
"\nTest %s <> %g\n",
AttName[Att], T->
Cut))
193 Ap =
Group(1, Kp, Lp, T) + 1;
215 SE = sqrt(T->
Errors * (KnownCases - T->
Errors) / (KnownCases + 1E-3))
220 for ( i = SplitI ; i > Ap ; i-- )
230 if ( GTErrs > 2 * LEErrs + 1 || GTErrs - LEErrs > 0.5 * SE )
242 for ( i = SplitI+1 ; i < Lp ; i++ )
252 if ( LEErrs > 2 * GTErrs + 1 || LEErrs - GTErrs > 0.5 * SE )
263 fprintf(
Of,
"\tLower = %g, Upper = %g\n", T->
Lower, T->
Upper))
275 Kp =
Group(v, Bp + Missing, Lp, T);
280 if ( Bp + Missing <= Kp &&
281 (Factor = CountCases(Bp + Missing, Kp) / KnownCases) > 1E-6 )
285 ForEach(i, Bp, Bp + Missing - 1)
297 for ( i = Kp ; i >= Bp ; i-- )