Sentence examples for tree procedure from inspiring English sources

However, all sources of information (i.e. optical, radar and topography) featured prominently in contributing to the classification tree procedure, reinforcing the idea that multi-source data are useful in the characterization of wetland land cover.

Figure 2 shows an example of these subgroups with different retention rates, as created by the CART-based classification tree procedure.

Although a decision tree procedure (with CHAID) suggested a WBC value of 7,230 cells/mm as a potential cut point, no evidence for a nonlinear component of WBC was observed using restricted cubic splines (data not shown).

To study potential threshold in WBC count for diabetes prediction, a restricted cubic spline (using R software) and a decision tree procedure with CHAID (χ Automatic Interaction Detection) method were used.

Univariate, multivariate and decision tree procedures were used to deduce a prediction rule from over 186 variables; retrospectively collated from clinical data for 213 patients.

This retrospective cohort study using an independent validation cohort has been designed to obtain a simple prediction rule to stratify hospital inpatients at initial diagnosis of CDI according to risk of mortality, using univariate, multivariate and decision tree procedures.

Confirmed spills detected in ENVISAT/ASAR images were used to create a decision-tree procedure that classifies every distinct dark object visible in SAR images into one out of four categories, which reflect growing probability of the oil spill presence: look-alikes, dubious spots, blurred spots and potential oil spills.

We developed cutoff scores to predict metastasis with Ki-67 and cyclin E in the different components of nephroblastoma by the CART (Classification and Regression Trees) procedure [30].

In Jump3, we use the Extra-Trees procedure, which randomizes the test at each split node of a tree (in step 2 of the jump tree algorithm).

It can be shown that the complexity for growing an ensemble of jump trees using the Extra-Trees procedure is O (T K S 2 N 2 ), where T is the number of trees and K is the number of randomly chosen candidate regulators when searching for the optimal split at a node.

The use of varying event penalties within a parsimony-based gene-tree species-tree reconciliation procedure allows the recovery of every possible reconciliation as the most parsimonious one.