Lines Matching refs:cv_n
249 int cv_n = params.getCVFolds();
251 if( cv_n > 0 )
253 w->cv_Tn.resize(n*cv_n);
254 w->cv_node_error.resize(n*cv_n);
255 w->cv_node_risk.resize(n*cv_n);
467 int i, j, k, n = (int)_sidx.size(), cv_n = params.getCVFolds();
470 cv::AutoBuffer<double> buf(std::max(m, 3)*(cv_n+1));
472 if( cv_n > 0 )
475 w->cv_Tn.resize(sz + cv_n);
476 w->cv_node_risk.resize(sz + cv_n);
477 w->cv_node_error.resize(sz + cv_n);
500 if( cv_n == 0 )
510 for( j = 0; j < cv_n; j++ )
521 for( j = 0; j < cv_n; j++ )
541 for( j = 0; j < cv_n; j++ )
560 w->cv_Tn[nidx*cv_n + j] = INT_MAX;
561 w->cv_node_risk[nidx*cv_n + j] = sum - max_val;
562 w->cv_node_error[nidx*cv_n + j] = sum_k - max_val_k;
581 if( cv_n == 0 )
595 double *cv_sum = buf, *cv_sum2 = cv_sum + cv_n;
596 double* cv_count = (double*)(cv_sum2 + cv_n);
598 for( j = 0; j < cv_n; j++ )
615 for( j = 0; j < cv_n; j++ )
622 for( j = 0; j < cv_n; j++ )
628 w->cv_node_risk[nidx*cv_n + j] = s2i - r*r*ci;
629 w->cv_node_error[nidx*cv_n + j] = s2 - 2*r*s + c*r*r;
630 w->cv_Tn[nidx*cv_n + j] = INT_MAX;
1202 int ti, tree_count = 0, j, cv_n = params.getCVFolds(), n = w->wnodes[root].sample_count;
1226 Mat err_jk(cv_n, tree_count, CV_64F);
1228 for( j = 0; j < cv_n; j++ )
1249 for( j = 0; j < cv_n; j++ )
1268 int nidx = root, pidx = -1, cv_n = params.getCVFolds();
1278 double t = fold >= 0 ? w->cv_Tn[nidx*cv_n + fold] : node->Tn;
1286 node->tree_risk = w->cv_node_risk[nidx*cv_n + fold];
1287 node->tree_error = w->cv_node_error[nidx*cv_n + fold];
1303 parent->alpha = ((fold >= 0 ? w->cv_node_risk[pidx*cv_n + fold] : parent->node_risk)
1324 int cv_n = params.getCVFolds(), nidx = root, pidx = -1;
1334 double t = fold >= 0 ? w->cv_Tn[nidx*cv_n + fold] : node->Tn;
1340 w->cv_Tn[nidx*cv_n + fold] = T;
