Lines Matching full:quality
845 int split_point, int inversed, float quality )
852 split->quality = quality;
859 CvDTreeSplit* CvDTreeTrainData::new_split_cat( int vi, float quality )
866 split->quality = quality;
1367 // TODO: check the split quality ...
1400 split->quality = (float)(split->quality*quality_scale);
1403 prev_split->next->quality > split->quality )
1419 // the function returns scale coefficients for surrogate split quality factors.
1420 // the scale is applied to normalize surrogate split quality relatively to the
1421 // best (primary) split quality. That is, if a surrogate split is absolutely
1422 // identical to the primary split, its quality will be set to the maximum value =
1423 // quality of the primary split; otherwise, it will be lower.
1425 // minimum possible quality (w/o considering the above mentioned scale)
1426 // for a surrogate split. Surrogate splits with quality less than node->maxlr
1523 return node->split->quality/(L + R);
1555 if( !best_split || best_split->quality < split->quality )
2246 split->quality = (float)best_val;
2247 if( split->quality <= node->maxlr || l_win == 0 || l_win == mi )
3031 importance[split->var_idx] += split->quality;
3057 cvWriteReal( fs, "quality", split->quality );
3272 split->quality = (float)cvReadRealByName( fs, fnode, "quality" );
