• documentation
main content

fit binary decision tree for multiclass classification -凯发k8网页登录

fit binary decision tree for multiclass classification

syntax

tree = fitctree(tbl,responsevarname)
tree = fitctree(tbl,formula)
tree = fitctree(tbl,y)
tree = fitctree(x,y)
tree = fitctree(___,name,value)

description

tree = fitctree(tbl,responsevarname) returns a fitted binary classification decision tree based on the input variables (also known as predictors, features, or attributes) contained in the table tbl and output (response or labels) contained in tbl.responsevarname. the returned binary tree splits branching nodes based on the values of a column of tbl.

tree = fitctree(tbl,formula) returns a fitted binary classification decision tree based on the input variables contained in the table tbl. formula is an explanatory model of the response and a subset of predictor variables in tbl used to fit tree.

tree = fitctree(tbl,y) returns a fitted binary classification decision tree based on the input variables contained in the table tbl and output in vector y.

example

tree = fitctree(x,y) returns a fitted binary classification decision tree based on the input variables contained in matrix x and output y. the returned binary tree splits branching nodes based on the values of a column of x.

example

tree = fitctree(___,name,value) fits a tree with additional options specified by one or more name-value pair arguments, using any of the previous syntaxes. for example, you can specify the algorithm used to find the best split on a categorical predictor, grow a cross-validated tree, or hold out a fraction of the input data for validation.

examples

grow a classification tree using the ionosphere data set.

load ionosphere
tc = fitctree(x,y)
tc = 
  classificationtree
             responsename: 'y'
    categoricalpredictors: []
               classnames: {'b'  'g'}
           scoretransform: 'none'
          numobservations: 351
  properties, methods

you can control the depth of the trees using the maxnumsplits, minleafsize, or minparentsize name-value pair parameters. fitctree grows deep decision trees by default. you can grow shallower trees to reduce model complexity or computation time.

load the ionosphere data set.

load ionosphere

the default values of the tree depth controllers for growing classification trees are:

  • n - 1 for maxnumsplits. n is the training sample size.

  • 1 for minleafsize.

  • 10 for minparentsize.

these default values tend to grow deep trees for large training sample sizes.

train a classification tree using the default values for tree depth control. cross-validate the model by using 10-fold cross-validation.

rng(1); % for reproducibility
mdldefault = fitctree(x,y,'crossval','on');

draw a histogram of the number of imposed splits on the trees. also, view one of the trees.

numbranches = @(x)sum(x.isbranch);
mdldefaultnumsplits = cellfun(numbranches, mdldefault.trained);
figure;
histogram(mdldefaultnumsplits)

figure contains an axes object. the axes object contains an object of type histogram.

view(mdldefault.trained{1},'mode','graph')

figure classification tree viewer contains an axes object and other objects of type uimenu, uicontrol. the axes object contains 51 objects of type line, text. one or more of the lines displays its values using only markers

the average number of splits is around 15.

suppose that you want a classification tree that is not as complex (deep) as the ones trained using the default number of splits. train another classification tree, but set the maximum number of splits at 7, which is about half the mean number of splits from the default classification tree. cross-validate the model by using 10-fold cross-validation.

mdl7 = fitctree(x,y,'maxnumsplits',7,'crossval','on');
view(mdl7.trained{1},'mode','graph')

figure classification tree viewer contains an axes object and other objects of type uimenu, uicontrol. the axes object contains 21 objects of type line, text. one or more of the lines displays its values using only markers

compare the cross-validation classification errors of the models.

classerrordefault = kfoldloss(mdldefault)
classerrordefault = 0.1168

classerror7 = kfoldloss(mdl7)
classerror7 = 0.1311

mdl7 is much less complex and performs only slightly worse than mdldefault.

this example shows how to optimize hyperparameters automatically using fitctree. the example uses fisher's iris data.

load fisher's iris data.

load fisheriris

optimize the cross-validation loss of the classifier, using the data in meas to predict the response in species.

x = meas;
y = species;
mdl = fitctree(x,y,'optimizehyperparameters','auto')
|======================================================================================|
| iter | eval   | objective   | objective   | bestsofar   | bestsofar   |  minleafsize |
|      | result |             | runtime     | (observed)  | (estim.)    |              |
|======================================================================================|
|    1 | best   |    0.066667 |      1.1229 |    0.066667 |    0.066667 |           31 |
|    2 | accept |    0.066667 |     0.27673 |    0.066667 |    0.066667 |           12 |
|    3 | best   |        0.04 |     0.17351 |        0.04 |    0.040003 |            2 |
|    4 | accept |     0.66667 |     0.16283 |        0.04 |     0.15796 |           73 |
|    5 | accept |        0.04 |     0.19612 |        0.04 |    0.040009 |            2 |
|    6 | accept |     0.66667 |     0.13837 |        0.04 |    0.040012 |           74 |
|    7 | accept |    0.066667 |     0.16369 |        0.04 |    0.040012 |           20 |
|    8 | accept |        0.04 |     0.08788 |        0.04 |    0.040008 |            4 |
|    9 | best   |    0.033333 |     0.10193 |    0.033333 |     0.03335 |            1 |
|   10 | accept |    0.066667 |     0.12459 |    0.033333 |     0.03335 |            7 |
|   11 | accept |        0.04 |     0.14685 |    0.033333 |    0.033348 |            3 |
|   12 | accept |    0.046667 |     0.10888 |    0.033333 |    0.033348 |            5 |
|   13 | accept |    0.033333 |     0.11246 |    0.033333 |     0.03334 |            1 |
|   14 | accept |    0.066667 |      0.1369 |    0.033333 |     0.03334 |           25 |
|   15 | accept |    0.033333 |     0.11997 |    0.033333 |    0.033337 |            1 |
|   16 | accept |    0.033333 |     0.17461 |    0.033333 |    0.033336 |            1 |
|   17 | accept |    0.066667 |     0.08787 |    0.033333 |    0.033336 |           15 |
|   18 | accept |     0.33333 |     0.10007 |    0.033333 |    0.033336 |           43 |
|   19 | accept |    0.066667 |      0.2173 |    0.033333 |    0.033336 |            9 |
|   20 | accept |    0.066667 |     0.20579 |    0.033333 |    0.033336 |            6 |
|======================================================================================|
| iter | eval   | objective   | objective   | bestsofar   | bestsofar   |  minleafsize |
|      | result |             | runtime     | (observed)  | (estim.)    |              |
|======================================================================================|
|   21 | accept |    0.066667 |     0.11666 |    0.033333 |    0.033336 |           17 |
|   22 | accept |    0.066667 |     0.10683 |    0.033333 |    0.033336 |           10 |
|   23 | accept |    0.066667 |     0.14524 |    0.033333 |    0.033336 |           35 |
|   24 | accept |     0.33333 |     0.23027 |    0.033333 |    0.034035 |           54 |
|   25 | accept |        0.04 |     0.10918 |    0.033333 |    0.034015 |            2 |
|   26 | accept |        0.04 |    0.085554 |    0.033333 |    0.033985 |            3 |
|   27 | accept |        0.04 |    0.073222 |    0.033333 |    0.033961 |            4 |
|   28 | accept |    0.066667 |     0.10421 |    0.033333 |    0.033933 |            8 |
|   29 | accept |    0.066667 |     0.19969 |    0.033333 |     0.03391 |           22 |
|   30 | accept |    0.066667 |     0.10031 |    0.033333 |    0.033889 |           13 |

figure contains an axes object. the axes object with title min objective vs. number of function evaluations, xlabel function evaluations, ylabel min objective contains 2 objects of type line. these objects represent min observed objective, estimated min objective.

figure contains an axes object. the axes object with title objective function model, xlabel minleafsize, ylabel estimated objective function value contains 8 objects of type line. one or more of the lines displays its values using only markers these objects represent observed points, model mean, model error bars, noise error bars, next point, model minimum feasible.

__________________________________________________________
optimization completed.
maxobjectiveevaluations of 30 reached.
total function evaluations: 30
total elapsed time: 32.7112 seconds
total objective function evaluation time: 5.2304
best observed feasible point:
    minleafsize
    ___________
         1     
observed objective function value = 0.033333
estimated objective function value = 0.033889
function evaluation time = 0.10193
best estimated feasible point (according to models):
    minleafsize
    ___________
         1     
estimated objective function value = 0.033889
estimated function evaluation time = 0.14363

mdl = 
  classificationtree
                         responsename: 'y'
                categoricalpredictors: []
                           classnames: {'setosa'  'versicolor'  'virginica'}
                       scoretransform: 'none'
                      numobservations: 150
    hyperparameteroptimizationresults: [1x1 bayesianoptimization]
  properties, methods

load the census1994 data set. consider a model that predicts a person's salary category given their age, working class, education level, martial status, race, sex, capital gain and loss, and number of working hours per week.

load census1994
x = adultdata(:,{'age','workclass','education_num','marital_status','race',...
    'sex','capital_gain','capital_loss','hours_per_week','salary'});

display the number of categories represented in the categorical variables using summary.

summary(x)
variables:
    age: 32561x1 double
        values:
            min          17   
            median       37   
            max          90   
    workclass: 32561x1 categorical
        values:
            federal-gov            960  
            local-gov             2093  
            never-worked             7  
            private              22696  
            self-emp-inc          1116  
            self-emp-not-inc      2541  
            state-gov             1298  
            without-pay             14  
            nummissing            1836  
    education_num: 32561x1 double
        values:
            min           1   
            median       10   
            max          16   
    marital_status: 32561x1 categorical
        values:
            divorced                   4443  
            married-af-spouse            23  
            married-civ-spouse        14976  
            married-spouse-absent       418  
            never-married             10683  
            separated                  1025  
            widowed                     993  
    race: 32561x1 categorical
        values:
            amer-indian-eskimo       311  
            asian-pac-islander      1039  
            black                   3124  
            other                    271  
            white                  27816  
    sex: 32561x1 categorical
        values:
            female     10771  
            male       21790  
    capital_gain: 32561x1 double
        values:
            min            0  
            median         0  
            max        99999  
    capital_loss: 32561x1 double
        values:
            min            0  
            median         0  
            max         4356  
    hours_per_week: 32561x1 double
        values:
            min           1   
            median       40   
            max          99   
    salary: 32561x1 categorical
        values:
            <=50k     24720  
            >50k       7841

because there are few categories represented in the categorical variables compared to levels in the continuous variables, the standard cart, predictor-splitting algorithm prefers splitting a continuous predictor over the categorical variables.

train a classification tree using the entire data set. to grow unbiased trees, specify usage of the curvature test for splitting predictors. because there are missing observations in the data, specify usage of surrogate splits.

mdl = fitctree(x,'salary','predictorselection','curvature',...
    'surrogate','on');

estimate predictor importance values by summing changes in the risk due to splits on every predictor and dividing the sum by the number of branch nodes. compare the estimates using a bar graph.

imp = predictorimportance(mdl);
figure;
bar(imp);
title('predictor importance estimates');
ylabel('estimates');
xlabel('predictors');
h = gca;
h.xticklabel = mdl.predictornames;
h.xticklabelrotation = 45;
h.ticklabelinterpreter = 'none';

figure contains an axes object. the axes object with title predictor importance estimates, xlabel predictors, ylabel estimates contains an object of type bar.

in this case, capital_gain is the most important predictor, followed by education_num.

this example shows how to optimize hyperparameters of a classification tree automatically using a tall array. the sample data set airlinesmall.csv is a large data set that contains a tabular file of airline flight data. this example creates a tall table containing the data and uses it to run the optimization procedure.

when you perform calculations on tall arrays, matlab® uses either a parallel pool (default if you have parallel computing toolbox™) or the local matlab session. if you want to run the example using the local matlab session when you have parallel computing toolbox, you can change the global execution environment by using the function.

create a datastore that references the folder location with the data. select a subset of the variables to work with, and treat 'na' values as missing data so that datastore replaces them with nan values. create a tall table that contains the data in the datastore.

ds = datastore('airlinesmall.csv');
ds.selectedvariablenames = {'month','dayofmonth','dayofweek',...
                            'deptime','arrdelay','distance','depdelay'};
ds.treatasmissing = 'na';
tt  = tall(ds) % tall table
starting parallel pool (parpool) using the 'local' profile ...
connected to the parallel pool (number of workers: 6).
tt =
  m×7 tall table
    month    dayofmonth    dayofweek    deptime    arrdelay    distance    depdelay
    _____    __________    _________    _______    ________    ________    ________
     10          21            3          642          8         308          12   
     10          26            1         1021          8         296           1   
     10          23            5         2055         21         480          20   
     10          23            5         1332         13         296          12   
     10          22            4          629          4         373          -1   
     10          28            3         1446         59         308          63   
     10           8            4          928          3         447          -2   
     10          10            6          859         11         954          -1   
      :          :             :           :          :           :           :
      :          :             :           :          :           :           :

determine the flights that are late by 10 minutes or more by defining a logical variable that is true for a late flight. this variable contains the class labels. a preview of this variable includes the first few rows.

y = tt.depdelay > 10 % class labels
y =
  m×1 tall logical array
   1
   0
   1
   1
   0
   1
   0
   0
   :
   :

create a tall array for the predictor data.

x = tt{:,1:end-1} % predictor data
x =
  m×6 tall double matrix
          10          21           3         642           8         308
          10          26           1        1021           8         296
          10          23           5        2055          21         480
          10          23           5        1332          13         296
          10          22           4         629           4         373
          10          28           3        1446          59         308
          10           8           4         928           3         447
          10          10           6         859          11         954
          :           :            :          :           :           :
          :           :            :          :           :           :

remove rows in x and y that contain missing data.

r = rmmissing([x y]); % data with missing entries removed
x = r(:,1:end-1); 
y = r(:,end);

standardize the predictor variables.

z = zscore(x);

optimize hyperparameters automatically using the 'optimizehyperparameters' name-value pair argument. find the optimal 'minleafsize' value that minimizes holdout cross-validation loss. (specifying 'auto' uses 'minleafsize'.) for reproducibility, use the 'expected-improvement-plus' acquisition function and set the seeds of the random number generators using rng and tallrng. the results can vary depending on the number of workers and the execution environment for the tall arrays. for details, see .

rng('default') 
tallrng('default')
[mdl,fitinfo,hyperparameteroptimizationresults] = fitctree(z,y,...
    'optimizehyperparameters','auto',...
    'hyperparameteroptimizationoptions',struct('holdout',0.3,...
    'acquisitionfunctionname','expected-improvement-plus'))
evaluating tall expression using the parallel pool 'local':
- pass 1 of 3: completed in 5.6 sec
- pass 2 of 3: completed in 2.1 sec
- pass 3 of 3: completed in 3.4 sec
evaluation completed in 13 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.73 sec
evaluation completed in 0.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 1.2 sec
evaluation completed in 1.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.64 sec
- pass 2 of 4: completed in 1.1 sec
- pass 3 of 4: completed in 0.72 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 5.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.73 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 0.8 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.79 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.87 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.8 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.89 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.57 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 1 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.68 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 4.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.65 sec
- pass 2 of 4: completed in 0.73 sec
- pass 3 of 4: completed in 0.65 sec
- pass 4 of 4: completed in 1.7 sec
evaluation completed in 4.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.63 sec
- pass 2 of 4: completed in 0.85 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 2.2 sec
evaluation completed in 4.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.2 sec
- pass 2 of 4: completed in 0.88 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 3 sec
evaluation completed in 6.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.72 sec
- pass 2 of 4: completed in 0.96 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 4.2 sec
evaluation completed in 7.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.77 sec
- pass 2 of 4: completed in 0.95 sec
- pass 3 of 4: completed in 0.65 sec
- pass 4 of 4: completed in 4.8 sec
evaluation completed in 7.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.79 sec
- pass 2 of 4: completed in 1 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 5.1 sec
evaluation completed in 8.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.89 sec
- pass 2 of 4: completed in 1.1 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 5.8 sec
evaluation completed in 9.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 1.2 sec
- pass 3 of 4: completed in 0.63 sec
- pass 4 of 4: completed in 5.2 sec
evaluation completed in 8.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.6 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.74 sec
- pass 4 of 4: completed in 4.8 sec
evaluation completed in 9.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.68 sec
- pass 4 of 4: completed in 3.9 sec
evaluation completed in 7.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.6 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.7 sec
- pass 4 of 4: completed in 3 sec
evaluation completed in 7.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.66 sec
- pass 4 of 4: completed in 2.5 sec
evaluation completed in 6.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.66 sec
- pass 4 of 4: completed in 2.2 sec
evaluation completed in 5.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.69 sec
- pass 4 of 4: completed in 1.9 sec
evaluation completed in 5.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.2 sec
- pass 2 of 4: completed in 1.4 sec
- pass 3 of 4: completed in 0.67 sec
- pass 4 of 4: completed in 1.6 sec
evaluation completed in 5.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.3 sec
- pass 2 of 4: completed in 1.4 sec
- pass 3 of 4: completed in 0.65 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 5.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.67 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.2 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.73 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 5.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.65 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 5.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 2.4 sec
evaluation completed in 2.6 sec
|======================================================================================|
| iter | eval   | objective   | objective   | bestsofar   | bestsofar   |  minleafsize |
|      | result |             | runtime     | (observed)  | (estim.)    |              |
|======================================================================================|
|    1 | best   |     0.11572 |      197.12 |     0.11572 |     0.11572 |           10 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.4 sec
evaluation completed in 0.56 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.93 sec
evaluation completed in 1.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 0.84 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 1.4 sec
evaluation completed in 1.6 sec
|    2 | accept |     0.19635 |      10.496 |     0.11572 |     0.12008 |        48298 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.33 sec
evaluation completed in 0.47 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.83 sec
evaluation completed in 0.99 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.68 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 0.74 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.48 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.51 sec
- pass 4 of 4: completed in 0.73 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.68 sec
- pass 4 of 4: completed in 0.77 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.48 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.86 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.5 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.75 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.75 sec
evaluation completed in 0.87 sec
|    3 | best   |      0.1048 |      44.614 |      0.1048 |     0.11431 |         3166 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.3 sec
evaluation completed in 0.45 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.83 sec
evaluation completed in 0.97 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.99 sec
- pass 2 of 4: completed in 0.68 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 0.73 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.47 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.82 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 0.89 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.6 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 0.75 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.5 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.63 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 4.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.8 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.66 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 4.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.62 sec
- pass 2 of 4: completed in 0.75 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 1.6 sec
evaluation completed in 4.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.6 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.9 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 1 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 4.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.8 sec
evaluation completed in 0.94 sec
|    4 | best   |     0.10094 |      91.723 |     0.10094 |     0.10574 |          180 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.3 sec
evaluation completed in 0.42 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.93 sec
evaluation completed in 1.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.66 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.83 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.51 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 0.88 sec
evaluation completed in 4.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.5 sec
- pass 4 of 4: completed in 0.98 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.5 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 1.2 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.7 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.73 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.58 sec
- pass 2 of 4: completed in 0.8 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 1.2 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.64 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.57 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.97 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.75 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.89 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.6 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 0.85 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.6 sec
- pass 2 of 4: completed in 0.82 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.79 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 1.3 sec
evaluation completed in 1.4 sec
|    5 | best   |     0.10087 |       82.84 |     0.10087 |     0.10085 |          219 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.32 sec
evaluation completed in 0.45 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.87 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.79 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.66 sec
- pass 3 of 4: completed in 0.5 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.68 sec
- pass 3 of 4: completed in 0.51 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.68 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.86 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 1 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 1.2 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.85 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.6 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.6 sec
- pass 4 of 4: completed in 0.84 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 0.87 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 0.92 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.77 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 1.2 sec
- pass 3 of 4: completed in 0.68 sec
- pass 4 of 4: completed in 0.86 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.77 sec
evaluation completed in 0.93 sec
|    6 | accept |     0.10155 |      61.043 |     0.10087 |     0.10089 |         1089 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.33 sec
evaluation completed in 0.46 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.89 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.8 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.85 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 1.2 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.83 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.87 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.9 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.51 sec
- pass 4 of 4: completed in 0.98 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.62 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 4.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 2 sec
evaluation completed in 4.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 2.7 sec
evaluation completed in 5.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.64 sec
- pass 2 of 4: completed in 0.87 sec
- pass 3 of 4: completed in 1.2 sec
- pass 4 of 4: completed in 3.7 sec
evaluation completed in 7.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.73 sec
- pass 2 of 4: completed in 0.92 sec
- pass 3 of 4: completed in 0.6 sec
- pass 4 of 4: completed in 4.4 sec
evaluation completed in 7.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.86 sec
- pass 2 of 4: completed in 1.5 sec
- pass 3 of 4: completed in 0.64 sec
- pass 4 of 4: completed in 4.8 sec
evaluation completed in 8.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.9 sec
- pass 2 of 4: completed in 1.1 sec
- pass 3 of 4: completed in 0.65 sec
- pass 4 of 4: completed in 5.2 sec
evaluation completed in 8.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.73 sec
- pass 4 of 4: completed in 5.6 sec
evaluation completed in 9.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.5 sec
- pass 2 of 4: completed in 1.6 sec
- pass 3 of 4: completed in 0.75 sec
- pass 4 of 4: completed in 5.8 sec
evaluation completed in 10 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.3 sec
- pass 2 of 4: completed in 1.4 sec
- pass 3 of 4: completed in 1.2 sec
- pass 4 of 4: completed in 5.1 sec
evaluation completed in 9.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.4 sec
- pass 2 of 4: completed in 1.5 sec
- pass 3 of 4: completed in 0.7 sec
- pass 4 of 4: completed in 4.1 sec
evaluation completed in 8.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.4 sec
- pass 2 of 4: completed in 1.6 sec
- pass 3 of 4: completed in 0.71 sec
- pass 4 of 4: completed in 3.6 sec
evaluation completed in 7.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.5 sec
- pass 2 of 4: completed in 1.8 sec
- pass 3 of 4: completed in 0.74 sec
- pass 4 of 4: completed in 3.2 sec
evaluation completed in 7.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.4 sec
- pass 2 of 4: completed in 1.7 sec
- pass 3 of 4: completed in 0.73 sec
- pass 4 of 4: completed in 2.8 sec
evaluation completed in 7.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.5 sec
- pass 2 of 4: completed in 1.7 sec
- pass 3 of 4: completed in 0.82 sec
- pass 4 of 4: completed in 2.4 sec
evaluation completed in 7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 2 sec
- pass 2 of 4: completed in 1.9 sec
- pass 3 of 4: completed in 0.79 sec
- pass 4 of 4: completed in 2.3 sec
evaluation completed in 7.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.6 sec
- pass 2 of 4: completed in 1.8 sec
- pass 3 of 4: completed in 0.73 sec
- pass 4 of 4: completed in 2.2 sec
evaluation completed in 6.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.6 sec
- pass 2 of 4: completed in 1.7 sec
- pass 3 of 4: completed in 0.79 sec
- pass 4 of 4: completed in 2.3 sec
evaluation completed in 7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.7 sec
- pass 2 of 4: completed in 1.9 sec
- pass 3 of 4: completed in 0.8 sec
- pass 4 of 4: completed in 1.8 sec
evaluation completed in 6.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.7 sec
- pass 2 of 4: completed in 1.8 sec
- pass 3 of 4: completed in 0.77 sec
- pass 4 of 4: completed in 1.8 sec
evaluation completed in 6.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.4 sec
- pass 2 of 4: completed in 1.6 sec
- pass 3 of 4: completed in 0.73 sec
- pass 4 of 4: completed in 1.8 sec
evaluation completed in 6.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.5 sec
- pass 2 of 4: completed in 1.7 sec
- pass 3 of 4: completed in 1.3 sec
- pass 4 of 4: completed in 1.7 sec
evaluation completed in 6.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.5 sec
- pass 2 of 4: completed in 1.7 sec
- pass 3 of 4: completed in 0.73 sec
- pass 4 of 4: completed in 1.8 sec
evaluation completed in 6.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 1.3 sec
evaluation completed in 1.5 sec
|    7 | accept |     0.13495 |      241.76 |     0.10087 |     0.10089 |            1 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.31 sec
evaluation completed in 0.44 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.87 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.47 sec
- pass 2 of 4: completed in 0.67 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.74 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.85 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 0.89 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.73 sec
- pass 3 of 4: completed in 0.6 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.62 sec
- pass 2 of 4: completed in 0.8 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 1.6 sec
evaluation completed in 4.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.2 sec
- pass 2 of 4: completed in 1.5 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 1.9 sec
evaluation completed in 6.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.69 sec
- pass 2 of 4: completed in 0.88 sec
- pass 3 of 4: completed in 0.75 sec
- pass 4 of 4: completed in 2.1 sec
evaluation completed in 5.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 2.2 sec
evaluation completed in 4.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.84 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 2.2 sec
evaluation completed in 4.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.68 sec
- pass 2 of 4: completed in 0.85 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 2.2 sec
evaluation completed in 4.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.68 sec
- pass 2 of 4: completed in 0.91 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 2.4 sec
evaluation completed in 5.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.92 sec
- pass 2 of 4: completed in 0.86 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 1.6 sec
evaluation completed in 4.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.69 sec
- pass 2 of 4: completed in 0.91 sec
- pass 3 of 4: completed in 0.63 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.67 sec
- pass 2 of 4: completed in 0.86 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.99 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.2 sec
- pass 2 of 4: completed in 0.9 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.95 sec
evaluation completed in 4.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.73 sec
- pass 2 of 4: completed in 0.91 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.91 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.76 sec
- pass 2 of 4: completed in 0.93 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.9 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.91 sec
evaluation completed in 1.1 sec
|    8 | accept |     0.10246 |      115.31 |     0.10087 |     0.10089 |           58 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.34 sec
evaluation completed in 0.49 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.87 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.8 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.48 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.79 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1 sec
- pass 2 of 4: completed in 0.75 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 4.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.6 sec
- pass 4 of 4: completed in 0.9 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.73 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.75 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 1.2 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.6 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.95 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.94 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.58 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.83 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.83 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.6 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.77 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.72 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.6 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 1.3 sec
evaluation completed in 1.4 sec
|    9 | accept |     0.10173 |      77.229 |     0.10087 |     0.10086 |          418 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.32 sec
evaluation completed in 0.46 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.84 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.75 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.68 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.91 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 0.82 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 0.82 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.95 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.73 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 1.7 sec
evaluation completed in 4.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.58 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 1.7 sec
evaluation completed in 4.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.71 sec
- pass 2 of 4: completed in 1.7 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 1.7 sec
evaluation completed in 5.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.65 sec
- pass 2 of 4: completed in 0.83 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.67 sec
- pass 2 of 4: completed in 0.87 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.82 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.65 sec
- pass 2 of 4: completed in 0.84 sec
- pass 3 of 4: completed in 0.62 sec
- pass 4 of 4: completed in 0.89 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.64 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.88 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.62 sec
- pass 2 of 4: completed in 0.9 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.86 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.65 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.8 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.77 sec
evaluation completed in 0.89 sec
|   10 | accept |     0.10114 |      94.532 |     0.10087 |     0.10091 |          123 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.86 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.83 sec
evaluation completed in 0.99 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.48 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.8 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.79 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.73 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.85 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.82 sec
- pass 3 of 4: completed in 0.64 sec
- pass 4 of 4: completed in 0.94 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.97 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.8 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 1.2 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 0.8 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 1.1 sec
evaluation completed in 4.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.65 sec
- pass 2 of 4: completed in 0.84 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 1 sec
evaluation completed in 4.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.63 sec
- pass 2 of 4: completed in 0.84 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.9 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.2 sec
- pass 2 of 4: completed in 0.83 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.81 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.65 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.8 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.77 sec
evaluation completed in 0.89 sec
|   11 | best   |      0.1008 |      90.637 |      0.1008 |     0.10088 |          178 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.38 sec
evaluation completed in 0.52 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.88 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.51 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.59 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.79 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.58 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.93 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.57 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 0.83 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 1.2 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.91 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.58 sec
- pass 2 of 4: completed in 0.85 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 1 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 1.2 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 1.1 sec
- pass 2 of 4: completed in 0.81 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 4.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 3.9 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 1.5 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.82 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 1.4 sec
evaluation completed in 4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.66 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 1.2 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.79 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 1.2 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.62 sec
- pass 2 of 4: completed in 0.85 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 1 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.61 sec
- pass 2 of 4: completed in 0.86 sec
- pass 3 of 4: completed in 1.1 sec
- pass 4 of 4: completed in 0.96 sec
evaluation completed in 4.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.65 sec
- pass 2 of 4: completed in 0.8 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.86 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.69 sec
- pass 2 of 4: completed in 0.84 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.83 sec
evaluation completed in 3.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.76 sec
evaluation completed in 0.89 sec
|   12 | accept |      0.1008 |      90.267 |      0.1008 |     0.10086 |          179 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.32 sec
evaluation completed in 0.45 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.9 sec
evaluation completed in 1.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.58 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.77 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.49 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 0.77 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.51 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.72 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.74 sec
- pass 3 of 4: completed in 0.51 sec
- pass 4 of 4: completed in 1.3 sec
evaluation completed in 3.6 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.74 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.83 sec
evaluation completed in 0.97 sec
|   13 | accept |     0.11126 |      32.134 |      0.1008 |     0.10084 |        10251 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.32 sec
evaluation completed in 0.45 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.85 sec
evaluation completed in 0.99 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.75 sec
- pass 3 of 4: completed in 0.55 sec
- pass 4 of 4: completed in 0.74 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.7 sec
- pass 3 of 4: completed in 0.57 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.68 sec
- pass 3 of 4: completed in 0.53 sec
- pass 4 of 4: completed in 0.79 sec
evaluation completed in 3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.91 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 1.2 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.86 sec
evaluation completed in 3.7 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 1 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.71 sec
- pass 3 of 4: completed in 0.64 sec
- pass 4 of 4: completed in 0.99 sec
evaluation completed in 3.4 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.54 sec
- pass 2 of 4: completed in 1.2 sec
- pass 3 of 4: completed in 0.58 sec
- pass 4 of 4: completed in 0.94 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.51 sec
- pass 2 of 4: completed in 0.77 sec
- pass 3 of 4: completed in 0.59 sec
- pass 4 of 4: completed in 0.9 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 0.78 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.9 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.55 sec
- pass 2 of 4: completed in 0.72 sec
- pass 3 of 4: completed in 0.52 sec
- pass 4 of 4: completed in 0.89 sec
evaluation completed in 3.2 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.58 sec
- pass 2 of 4: completed in 0.76 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.8 sec
evaluation completed in 3.3 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.56 sec
- pass 2 of 4: completed in 1.3 sec
- pass 3 of 4: completed in 0.61 sec
- pass 4 of 4: completed in 0.76 sec
evaluation completed in 3.8 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.83 sec
evaluation completed in 0.97 sec
|   14 | accept |     0.10154 |      66.262 |      0.1008 |     0.10085 |          736 |
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.36 sec
evaluation completed in 0.5 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 1: completed in 0.89 sec
evaluation completed in 1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.53 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.74 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.5 sec
- pass 2 of 4: completed in 0.67 sec
- pass 3 of 4: completed in 0.56 sec
- pass 4 of 4: completed in 0.78 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
- pass 1 of 4: completed in 0.52 sec
- pass 2 of 4: completed in 0.69 sec
- pass 3 of 4: completed in 0.54 sec
- pass 4 of 4: completed in 0.84 sec
evaluation completed in 3.1 sec
evaluating tall expression using the parallel pool 'local':
evaluation 0% ...

mdl = 
  compactclassificationtree
             responsename: 'y'
    categoricalpredictors: []
               classnames: [0 1]
           scoretransform: 'none'
  properties, methods

fitinfo = struct with no fields.

hyperparameteroptimizationresults = 
  bayesianoptimization with properties:
                      objectivefcn: @createobjfcn/tallobjfcn
              variabledescriptions: [4×1 optimizablevariable]
                           options: [1×1 struct]
                      minobjective: 0.1004
                   xatminobjective: [1×1 table]
             minestimatedobjective: 0.1008
          xatminestimatedobjective: [1×1 table]
           numobjectiveevaluations: 30
                  totalelapsedtime: 3.0367e 03
                         nextpoint: [1×1 table]
                            xtrace: [30×1 table]
                    objectivetrace: [30×1 double]
                  constraintstrace: []
                     userdatatrace: {30×1 cell}
      objectiveevaluationtimetrace: [30×1 double]
                iterationtimetrace: [30×1 double]
                        errortrace: [30×1 double]
                  feasibilitytrace: [30×1 logical]
       feasibilityprobabilitytrace: [30×1 double]
               indexofminimumtrace: [30×1 double]
             objectiveminimumtrace: [30×1 double]
    estimatedobjectiveminimumtrace: [30×1 double]

input arguments

sample data used to train the model, specified as a table. each row of tbl corresponds to one observation, and each column corresponds to one predictor variable. optionally, tbl can contain one additional column for the response variable. multicolumn variables and cell arrays other than cell arrays of character vectors are not allowed.

  • if tbl contains the response variable, and you want to use all remaining variables in tbl as predictors, then specify the response variable by using responsevarname.

  • if tbl contains the response variable, and you want to use only a subset of the remaining variables in tbl as predictors, then specify a formula by using formula.

  • if tbl does not contain the response variable, then specify a response variable by using y. the length of the response variable and the number of rows in tbl must be equal.

response variable name, specified as the name of a variable in tbl.

you must specify responsevarname as a character vector or string scalar. for example, if the response variable y is stored as tbl.y, then specify it as "y". otherwise, the software treats all columns of tbl, including y, as predictors when training the model.

the response variable must be a categorical, character, or string array; a logical or numeric vector; or a cell array of character vectors. if y is a character array, then each element of the response variable must correspond to one row of the array.

a good practice is to specify the order of the classes by using the classnames name-value argument.

data types: char | string

explanatory model of the response variable and a subset of the predictor variables, specified as a character vector or string scalar in the form "y~x1 x2 x3". in this form, y represents the response variable, and x1, x2, and x3 represent the predictor variables.

to specify a subset of variables in tbl as predictors for training the model, use a formula. if you specify a formula, then the software does not use any variables in tbl that do not appear in formula.

the variable names in the formula must be both variable names in tbl (tbl.properties.variablenames) and valid matlab® identifiers. you can verify the variable names in tbl by using the isvarname function. if the variable names are not valid, then you can convert them by using the matlab.lang.makevalidname function.

data types: char | string

class labels, specified as a numeric vector, categorical vector, logical vector, character array, string array, or cell array of character vectors. each row of y represents the classification of the corresponding row of x.

when fitting the tree, fitctree considers nan, '' (empty character vector), "" (empty string), , and values in y to be missing values. fitctree does not use observations with missing values for y in the fit.

for numeric y, consider fitting a regression tree using fitrtree instead.

data types: single | double | categorical | logical | char | string | cell

predictor data, specified as a numeric matrix. each row of x corresponds to one observation, and each column corresponds to one predictor variable.

fitctree considers nan values in x as missing values. fitctree does not use observations with all missing values for x in the fit. fitctree uses observations with some missing values for x to find splits on variables for which these observations have valid values.

data types: single | double

name-value arguments

specify optional pairs of arguments as name1=value1,...,namen=valuen, where name is the argument name and value is the corresponding value. name-value arguments must appear after other arguments, but the order of the pairs does not matter.

before r2021a, use commas to separate each name and value, and enclose name in quotes.

example: 'crossval','on','minleafsize',40 specifies a cross-validated classification tree with a minimum of 40 observations per leaf.

note

you cannot use any cross-validation name-value argument together with the 'optimizehyperparameters' name-value argument. you can modify the cross-validation for 'optimizehyperparameters' only by using the 'hyperparameteroptimizationoptions' name-value argument.

model parameters

algorithm to find the best split on a categorical predictor with c categories for data and k ≥ 3 classes, specified as the comma-separated pair consisting of 'algorithmforcategorical' and one of the following values.

valuedescription
'exact'consider all 2c–1 – 1 combinations.
'pullleft'start with all c categories on the right branch. consider moving each category to the left branch as it achieves the minimum impurity for the k classes among the remaining categories. from this sequence, choose the split that has the lowest impurity.
'pca'compute a score for each category using the inner product between the first principal component of a weighted covariance matrix (of the centered class probability matrix) and the vector of class probabilities for that category. sort the scores in ascending order, and consider all c – 1 splits.
'ovabyclass'start with all c categories on the right branch. for each class, order the categories based on their probability for that class. for the first class, consider moving each category to the left branch in order, recording the impurity criterion at each move. repeat for the remaining classes. from this sequence, choose the split that has the minimum impurity.

fitctree automatically selects the optimal subset of algorithms for each split using the known number of classes and levels of a categorical predictor. for k = 2 classes, fitctree always performs the exact search. to specify a particular algorithm, use the 'algorithmforcategorical' name-value pair argument.

for more details, see .

example: 'algorithmforcategorical','pca'

categorical predictors list, specified as one of the values in this table.

valuedescription
vector of positive integers

each entry in the vector is an index value indicating that the corresponding predictor is categorical. the index values are between 1 and p, where p is the number of predictors used to train the model.

if fitctree uses a subset of input variables as predictors, then the function indexes the predictors using only the subset. the categoricalpredictors values do not count the response variable, observation weights variable, or any other variables that the function does not use.

logical vector

a true entry means that the corresponding predictor is categorical. the length of the vector is p.

character matrixeach row of the matrix is the name of a predictor variable. the names must match the entries in predictornames. pad the names with extra blanks so each row of the character matrix has the same length.
string array or cell array of character vectorseach element in the array is the name of a predictor variable. the names must match the entries in predictornames.
"all"all predictors are categorical.

by default, if the predictor data is a table (tbl), fitctree assumes that a variable is categorical if it is a logical vector, unordered categorical vector, character array, string array, or cell array of character vectors. if the predictor data is a matrix (x), fitctree assumes that all predictors are continuous. to identify any other predictors as categorical predictors, specify them by using the categoricalpredictors name-value argument.

example: 'categoricalpredictors','all'

data types: single | double | logical | char | string | cell

names of classes to use for training, specified as a categorical, character, or string array; a logical or numeric vector; or a cell array of character vectors. classnames must have the same data type as the response variable in tbl or y.

if classnames is a character array, then each element must correspond to one row of the array.

use classnames to:

  • specify the order of the classes during training.

  • specify the order of any input or output argument dimension that corresponds to the class order. for example, use classnames to specify the order of the dimensions of cost or the column order of classification scores returned by predict.

  • select a subset of classes for training. for example, suppose that the set of all distinct class names in y is ["a","b","c"]. to train the model using observations from classes "a" and "c" only, specify "classnames",["a","c"].

the default value for classnames is the set of all distinct class names in the response variable in tbl or y.

example: "classnames",["b","g"]

data types: categorical | char | string | logical | single | double | cell

cost of misclassification of a point, specified as the comma-separated pair consisting of 'cost' and one of the following:

  • square matrix, where cost(i,j) is the cost of classifying a point into class j if its true class is i (i.e., the rows correspond to the true class and the columns correspond to the predicted class). to specify the class order for the corresponding rows and columns of cost, also specify the classnames name-value pair argument.

  • structure s having two fields: s.classnames containing the group names as a variable of the same data type as y, and s.classificationcosts containing the cost matrix.

the default is cost(i,j)=1 if i~=j, and cost(i,j)=0 if i=j.

data types: single | double | struct

maximum tree depth, specified as the comma-separated pair consisting of 'maxdepth' and a positive integer. specify a value for this argument to return a tree that has fewer levels and requires fewer passes through the tall array to compute. generally, the algorithm of fitctree takes one pass through the data and an additional pass for each tree level. the function does not set a maximum tree depth, by default.

note

this option applies only when you use fitctree on tall arrays. see tall arrays for more information.

maximum category levels, specified as the comma-separated pair consisting of 'maxnumcategories' and a nonnegative scalar value. fitctree splits a categorical predictor using the exact search algorithm if the predictor has at most maxnumcategories levels in the split node. otherwise, fitctree finds the best categorical split using one of the inexact algorithms.

passing a small value can lead to loss of accuracy and passing a large value can increase computation time and memory overload.

example: 'maxnumcategories',8

maximal number of decision splits (or branch nodes), specified as the comma-separated pair consisting of 'maxnumsplits' and a positive integer. fitctree splits maxnumsplits or fewer branch nodes. for more details on splitting behavior, see algorithms.

example: 'maxnumsplits',5

data types: single | double

leaf merge flag, specified as the comma-separated pair consisting of 'mergeleaves' and 'on' or 'off'.

if mergeleaves is 'on', then fitctree:

  • merges leaves that originate from the same parent node, and that yields a sum of risk values greater or equal to the risk associated with the parent node

  • estimates the optimal sequence of pruned subtrees, but does not prune the classification tree

otherwise, fitctree does not merge leaves.

example: 'mergeleaves','off'

minimum number of leaf node observations, specified as the comma-separated pair consisting of 'minleafsize' and a positive integer value. each leaf has at least minleafsize observations per tree leaf. if you supply both minparentsize and minleafsize, fitctree uses the setting that gives larger leaves: minparentsize = max(minparentsize,2*minleafsize).

example: 'minleafsize',3

data types: single | double

minimum number of branch node observations, specified as the comma-separated pair consisting of 'minparentsize' and a positive integer value. each branch node in the tree has at least minparentsize observations. if you supply both minparentsize and minleafsize, fitctree uses the setting that gives larger leaves: minparentsize = max(minparentsize,2*minleafsize).

example: 'minparentsize',8

data types: single | double

number of bins for numeric predictors, specified as the comma-separated pair consisting of 'numbins' and a positive integer scalar.

  • if the 'numbins' value is empty (default), then fitctree does not bin any predictors.

  • if you specify the 'numbins' value as a positive integer scalar (numbins), then fitctree bins every numeric predictor into at most numbins equiprobable bins, and then grows trees on the bin indices instead of the original data.

    • the number of bins can be less than numbins if a predictor has fewer than numbins unique values.

    • fitctree does not bin categorical predictors.

when you use a large training data set, this binning option speeds up training but might cause a potential decrease in accuracy. you can try 'numbins',50 first, and then change the value depending on the accuracy and training speed.

a trained model stores the bin edges in the binedges property.

example: 'numbins',50

data types: single | double

number of predictors to select at random for each split, specified as the comma-separated pair consisting of 'numvariablestosample' and a positive integer value. alternatively, you can specify 'all' to use all available predictors.

if the training data includes many predictors and you want to analyze predictor importance, then specify 'numvariablestosample' as 'all'. otherwise, the software might not select some predictors, underestimating their importance.

to reproduce the random selections, you must set the seed of the random number generator by using and specify 'reproducible',true.

example: 'numvariablestosample',3

data types: char | string | single | double

predictor variable names, specified as a string array of unique names or cell array of unique character vectors. the functionality of predictornames depends on the way you supply the training data.

  • if you supply x and y, then you can use predictornames to assign names to the predictor variables in x.

    • the order of the names in predictornames must correspond to the column order of x. that is, predictornames{1} is the name of x(:,1), predictornames{2} is the name of x(:,2), and so on. also, size(x,2) and numel(predictornames) must be equal.

    • by default, predictornames is {'x1','x2',...}.

  • if you supply tbl, then you can use predictornames to choose which predictor variables to use in training. that is, fitctree uses only the predictor variables in predictornames and the response variable during training.

    • predictornames must be a subset of tbl.properties.variablenames and cannot include the name of the response variable.

    • by default, predictornames contains the names of all predictor variables.

    • a good practice is to specify the predictors for training using either predictornames or formula, but not both.

example: "predictornames",["sepallength","sepalwidth","petallength","petalwidth"]

data types: string | cell

algorithm used to select the best split predictor at each node, specified as the comma-separated pair consisting of 'predictorselection' and a value in this table.

valuedescription
'allsplits'

standard cart — selects the split predictor that maximizes the split-criterion gain over all possible splits of all predictors [1].

'curvature'curvature test — selects the split predictor that minimizes the p-value of chi-square tests of independence between each predictor and the response [4]. training speed is similar to standard cart.
'interaction-curvature'interaction test — chooses the split predictor that minimizes the p-value of chi-square tests of independence between each predictor and the response, and that minimizes the p-value of a chi-square test of independence between each pair of predictors and response [3]. training speed can be slower than standard cart.

for 'curvature' and 'interaction-curvature', if all tests yield p-values greater than 0.05, then fitctree stops splitting nodes.

tip

  • standard cart tends to select split predictors containing many distinct values, e.g., continuous variables, over those containing few distinct values, e.g., categorical variables [4]. consider specifying the curvature or interaction test if any of the following are true:

    • if there are predictors that have relatively fewer distinct values than other predictors, for example, if the predictor data set is heterogeneous.

    • if an analysis of predictor importance is your goal. for more on predictor importance estimation, see and introduction to feature selection.

  • trees grown using standard cart are not sensitive to predictor variable interactions. also, such trees are less likely to identify important variables in the presence of many irrelevant predictors than the application of the interaction test. therefore, to account for predictor interactions and identify importance variables in the presence of many irrelevant variables, specify the interaction test [3].

  • prediction speed is unaffected by the value of 'predictorselection'.

for details on how fitctree selects split predictors, see node splitting rules and .

example: 'predictorselection','curvature'

prior probabilities for each class, specified as one of the following:

  • character vector or string scalar.

    • 'empirical' determines class probabilities from class frequencies in the response variable in y or tbl. if you pass observation weights, fitctree uses the weights to compute the class probabilities.

    • 'uniform' sets all class probabilities to be equal.

  • vector (one scalar value for each class). to specify the class order for the corresponding elements of 'prior', set the 'classnames' name-value argument.

  • structure s with two fields.

    • s.classnames contains the class names as a variable of the same type as the response variable in y or tbl.

    • s.classprobs contains a vector of corresponding probabilities.

fitctree normalizes the weights in each class ('weights') to add up to the value of the prior probability of the respective class.

example: 'prior','uniform'

data types: char | string | single | double | struct

flag to estimate the optimal sequence of pruned subtrees, specified as the comma-separated pair consisting of 'prune' and 'on' or 'off'.

if prune is 'on', then fitctree grows the classification tree without pruning it, but estimates the optimal sequence of pruned subtrees. otherwise, fitctree grows the classification tree without estimating the optimal sequence of pruned subtrees.

to prune a trained model, pass it to prune.

example: 'prune','off'

pruning criterion, specified as the comma-separated pair consisting of 'prunecriterion' and 'error' or 'impurity'.

if you specify 'impurity', then fitctree uses the impurity measure specified by the 'splitcriterion' name-value pair argument.

for details, see impurity and node error.

example: 'prunecriterion','impurity'

flag to enforce reproducibility over repeated runs of training a model, specified as the comma-separated pair consisting of 'reproducible' and either false or true.

if 'numvariablestosample' is not 'all', then the software selects predictors at random for each split. to reproduce the random selections, you must specify 'reproducible',true and set the seed of the random number generator by using . note that setting 'reproducible' to true can slow down training.

example: 'reproducible',true

data types: logical

response variable name, specified as the comma-separated pair consisting of 'responsename' and a character vector or string scalar representing the name of the response variable.

this name-value pair is not valid when using the responsevarname or formula input arguments.

example: 'responsename','iristype'

data types: char | string

score transformation, specified as a character vector, string scalar, or function handle.

this table summarizes the available character vectors and string scalars.

valuedescription
"doublelogit"1/(1 e–2x)
"invlogit"log(x / (1 – x))
"ismax"sets the score for the class with the largest score to 1, and sets the scores for all other classes to 0
"logit"1/(1 e–x)
"none" or "identity"x (no transformation)
"sign"–1 for x < 0
0 for x = 0
1 for x > 0
"symmetric"2x – 1
"symmetricismax"sets the score for the class with the largest score to 1, and sets the scores for all other classes to –1
"symmetriclogit"2/(1 e–x) – 1

for a matlab function or a function you define, use its function handle for the score transform. the function handle must accept a matrix (the original scores) and return a matrix of the same size (the transformed scores).

example: "scoretransform","logit"

data types: char | string | function_handle

split criterion, specified as the comma-separated pair consisting of 'splitcriterion' and 'gdi' (gini's diversity index), 'twoing' for the twoing rule, or 'deviance' for maximum deviance reduction (also known as cross entropy).

for details, see impurity and node error.

example: 'splitcriterion','deviance'

surrogate decision splits flag, specified as the comma-separated pair consisting of 'surrogate' and 'on', 'off', 'all', or a positive integer value.

  • when set to 'on', fitctree finds at most 10 surrogate splits at each branch node.

  • when set to 'all', fitctree finds all surrogate splits at each branch node. the 'all' setting can use considerable time and memory.

  • when set to a positive integer value, fitctree finds at most the specified number of surrogate splits at each branch node.

use surrogate splits to improve the accuracy of predictions for data with missing values. the setting also lets you compute measures of predictive association between predictors. for more details, see node splitting rules.

example: 'surrogate','on'

data types: single | double | char | string

observation weights, specified as the comma-separated pair consisting of 'weights' and a vector of scalar values or the name of a variable in tbl. the software weights the observations in each row of x or tbl with the corresponding value in weights. the size of weights must equal the number of rows in x or tbl.

if you specify the input data as a table tbl, then weights can be the name of a variable in tbl that contains a numeric vector. in this case, you must specify weights as a character vector or string scalar. for example, if the weights vector w is stored as tbl.w, then specify it as 'w'. otherwise, the software treats all columns of tbl, including w, as predictors when training the model.

fitctree normalizes the weights in each class to add up to the value of the prior probability of the respective class.

data types: single | double | char | string

cross-validation options

flag to grow a cross-validated decision tree, specified as the comma-separated pair consisting of 'crossval' and 'on' or 'off'.

if 'on', fitctree grows a cross-validated decision tree with 10 folds. you can override this cross-validation setting using one of the 'kfold', 'holdout', 'leaveout', or 'cvpartition' name-value pair arguments. you can only use one of these four arguments at a time when creating a cross-validated tree.

alternatively, cross-validate tree later using the method.

example: 'crossval','on'

partition to use in a cross-validated tree, specified as the comma-separated pair consisting of 'cvpartition' and an object created using cvpartition.

if you use 'cvpartition', you cannot use any of the 'kfold', 'holdout', or 'leaveout' name-value pair arguments.

fraction of data used for holdout validation, specified as the comma-separated pair consisting of 'holdout' and a scalar value in the range [0,1]. holdout validation tests the specified fraction of the data, and uses the rest of the data for training.

if you use 'holdout', you cannot use any of the 'cvpartition', 'kfold', or 'leaveout' name-value pair arguments.

example: 'holdout',0.1

data types: single | double

number of folds to use in a cross-validated classifier, specified as the comma-separated pair consisting of 'kfold' and a positive integer value greater than 1. if you specify, e.g., 'kfold',k, then the software:

  1. randomly partitions the data into k sets

  2. for each set, reserves the set as validation data, and trains the model using the other k – 1 sets

  3. stores the k compact, trained models in the cells of a k-by-1 cell vector in the trained property of the cross-validated model.

to create a cross-validated model, you can use one of these four options only: cvpartition, holdout, kfold, or leaveout.

example: 'kfold',8

data types: single | double

leave-one-out cross-validation flag, specified as the comma-separated pair consisting of 'leaveout' and 'on' or 'off'. specify 'on' to use leave-one-out cross-validation.

if you use 'leaveout', you cannot use any of the 'cvpartition', 'holdout', or 'kfold' name-value pair arguments.

example: 'leaveout','on'

hyperparameter optimization options

parameters to optimize, specified as the comma-separated pair consisting of 'optimizehyperparameters' and one of the following:

  • 'none' — do not optimize.

  • 'auto' — use {'minleafsize'}

  • 'all' — optimize all eligible parameters.

  • string array or cell array of eligible parameter names

  • vector of optimizablevariable objects, typically the output of

the optimization attempts to minimize the cross-validation loss (error) for fitctree by varying the parameters. for information about cross-validation loss (albeit in a different context), see . to control the cross-validation type and other aspects of the optimization, use the hyperparameteroptimizationoptions name-value pair.

note

the values of 'optimizehyperparameters' override any values you specify using other name-value arguments. for example, setting 'optimizehyperparameters' to 'auto' causes fitctree to optimize hyperparameters corresponding to the 'auto' option and to ignore any specified values for the hyperparameters.

the eligible parameters for fitctree are:

  • maxnumsplits — fitctree searches among integers, by default log-scaled in the range [1,max(2,numobservations-1)].

  • minleafsize — fitctree searches among integers, by default log-scaled in the range [1,max(2,floor(numobservations/2))].

  • splitcriterion — for two classes, fitctree searches among 'gdi' and 'deviance'. for three or more classes, fitctree also searches among 'twoing'.

  • numvariablestosample — fitctree does not optimize over this hyperparameter. if you pass numvariablestosample as a parameter name, fitctree simply uses the full number of predictors. however, fitcensemble does optimize over this hyperparameter.

set nondefault parameters by passing a vector of optimizablevariable objects that have nondefault values. for example,

load fisheriris
params = hyperparameters('fitctree',meas,species);
params(1).range = [1,30];

pass params as the value of optimizehyperparameters.

by default, the iterative display appears at the command line, and plots appear according to the number of hyperparameters in the optimization. for the optimization and plots, the objective function is the misclassification rate. to control the iterative display, set the verbose field of the 'hyperparameteroptimizationoptions' name-value argument. to control the plots, set the showplots field of the 'hyperparameteroptimizationoptions' name-value argument.

for an example, see optimize classification tree.

example: 'auto'

options for optimization, specified as a structure. this argument modifies the effect of the optimizehyperparameters name-value argument. all fields in the structure are optional.

field namevaluesdefault
optimizer

  • 'bayesopt' — use bayesian optimization. internally, this setting calls .

  • 'gridsearch' — use grid search with numgriddivisions values per dimension.

  • 'randomsearch' — search at random among maxobjectiveevaluations points.

'gridsearch' searches in a random order, using uniform sampling without replacement from the grid. after optimization, you can get a table in grid order by using the command sortrows(mdl.hyperparameteroptimizationresults).

'bayesopt'
acquisitionfunctionname

  • 'expected-improvement-per-second-plus'

  • 'expected-improvement'

  • 'expected-improvement-plus'

  • 'expected-improvement-per-second'

  • 'lower-confidence-bound'

  • 'probability-of-improvement'

acquisition functions whose names include per-second do not yield reproducible results because the optimization depends on the runtime of the objective function. acquisition functions whose names include plus modify their behavior when they are overexploiting an area. for more details, see acquisition function types.

'expected-improvement-per-second-plus'
maxobjectiveevaluationsmaximum number of objective function evaluations.30 for 'bayesopt' and 'randomsearch', and the entire grid for 'gridsearch'
maxtime

time limit, specified as a positive real scalar. the time limit is in seconds, as measured by tic and toc. the run time can exceed maxtime because maxtime does not interrupt function evaluations.

inf
numgriddivisionsfor 'gridsearch', the number of values in each dimension. the value can be a vector of positive integers giving the number of values for each dimension, or a scalar that applies to all dimensions. this field is ignored for categorical variables.10
showplotslogical value indicating whether to show plots. if true, this field plots the best observed objective function value against the iteration number. if you use bayesian optimization (optimizer is 'bayesopt'), then this field also plots the best estimated objective function value. the best observed objective function values and best estimated objective function values correspond to the values in the bestsofar (observed) and bestsofar (estim.) columns of the iterative display, respectively. you can find these values in the properties objectiveminimumtrace and estimatedobjectiveminimumtrace of mdl.hyperparameteroptimizationresults. if the problem includes one or two optimization parameters for bayesian optimization, then showplots also plots a model of the objective function against the parameters.true
saveintermediateresultslogical value indicating whether to save results when optimizer is 'bayesopt'. if true, this field overwrites a workspace variable named 'bayesoptresults' at each iteration. the variable is a bayesianoptimization object.false
verbose

display at the command line:

  • 0 — no iterative display

  • 1 — iterative display

  • 2 — iterative display with extra information

for details, see the bayesopt name-value argument and the example .

1
useparallellogical value indicating whether to run bayesian optimization in parallel, which requires parallel computing toolbox™. due to the nonreproducibility of parallel timing, parallel bayesian optimization does not necessarily yield reproducible results. for details, see .false
repartition

logical value indicating whether to repartition the cross-validation at every iteration. if this field is false, the optimizer uses a single partition for the optimization.

the setting true usually gives the most robust results because it takes partitioning noise into account. however, for good results, true requires at least twice as many function evaluations.

false
use no more than one of the following three options.
cvpartitiona cvpartition object, as created by cvpartition'kfold',5 if you do not specify a cross-validation field
holdouta scalar in the range (0,1) representing the holdout fraction
kfoldan integer greater than 1

example: 'hyperparameteroptimizationoptions',struct('maxobjectiveevaluations',60)

data types: struct

output arguments

classification tree, returned as a classification tree object.

using the 'crossval', 'kfold', 'holdout', 'leaveout', or 'cvpartition' options results in a tree of class . you cannot use a partitioned tree for prediction, so this kind of tree does not have a predict method. instead, use to predict responses for observations not used for training.

otherwise, tree is of class , and you can use the method to make predictions.

more about

curvature test

the curvature test is a statistical test assessing the null hypothesis that two variables are unassociated.

the curvature test between predictor variable x and y is conducted using this process.

  1. if x is continuous, then partition it into its quartiles. create a nominal variable that bins observations according to which section of the partition they occupy. if there are missing values, then create an extra bin for them.

  2. for each level in the partitioned predictor j = 1...j and class in the response k = 1,...,k, compute the weighted proportion of observations in class k

    π^jk=∑i=1ni{yi=k}wi.

    wi is the weight of observation i, ∑wi=1, i is the indicator function, and n is the sample size. if all observations have the same weight, then π^jk=njkn, where njk is the number of observations in level j of the predictor that are in class k.

  3. compute the test statistic

    t=n∑k=1k∑j=1j(π^jk−π^j π^ k)2π^j π^ k

    π^j =∑kπ^jk, that is, the marginal probability of observing the predictor at level j. π^ k=∑jπ^jk, that is the marginal probability of observing class k. if n is large enough, then t is distributed as a χ2 with (k – 1)(j – 1) degrees of freedom.

  4. if the p-value for the test is less than 0.05, then reject the null hypothesis that there is no association between x and y.

when determining the best split predictor at each node, the standard cart algorithm prefers to select continuous predictors that have many levels. sometimes, such a selection can be spurious and can also mask more important predictors that have fewer levels, such as categorical predictors.

the curvature test can be applied instead of standard cart to determine the best split predictor at each node. in that case, the best split predictor variable is the one that minimizes the significant p-values (those less than 0.05) of curvature tests between each predictor and the response variable. such a selection is robust to the number of levels in individual predictors.

note

if levels of a predictor are pure for a particular class, then fitctree merges those levels. therefore, in step 3 of the algorithm, j can be less than the actual number of levels in the predictor. for example, if x has 4 levels, and all observations in bins 1 and 2 belong to class 1, then those levels are pure for class 1. consequently, fitctree merges the observations in bins 1 and 2, and j reduces to 3.

for more details on how the curvature test applies to growing classification trees, see node splitting rules and [4].

impurity and node error

a decision tree splits nodes based on either impurity or node error.

impurity means one of several things, depending on your choice of the splitcriterion name-value pair argument:

  • gini's diversity index (gdi) — the gini index of a node is

    1−∑ip2(i),

    where the sum is over the classes i at the node, and p(i) is the observed fraction of classes with class i that reach the node. a node with just one class (a pure node) has gini index 0; otherwise the gini index is positive. so the gini index is a measure of node impurity.

  • deviance ('deviance') — with p(i) defined the same as for the gini index, the deviance of a node is

    −∑ip(i)log2p(i).

    a pure node has deviance 0; otherwise, the deviance is positive.

  • twoing rule ('twoing') — twoing is not a purity measure of a node, but is a different measure for deciding how to split a node. let l(i) denote the fraction of members of class i in the left child node after a split, and r(i) denote the fraction of members of class i in the right child node after a split. choose the split criterion to maximize

    p(l)p(r)(∑i|l(i)−r(i)|)2,

    where p(l) and p(r) are the fractions of observations that split to the left and right respectively. if the expression is large, the split made each child node purer. similarly, if the expression is small, the split made each child node similar to each other, and therefore similar to the parent node. the split did not increase node purity.

  • node error — the node error is the fraction of misclassified classes at a node. if j is the class with the largest number of training samples at a node, the node error is

    1 – p(j).

interaction test

the interaction test is a statistical test that assesses the null hypothesis that there is no interaction between a pair of predictor variables and the response variable.

the interaction test assessing the association between predictor variables x1 and x2 with respect to y is conducted using this process.

  1. if x1 or x2 is continuous, then partition that variable into its quartiles. create a nominal variable that bins observations according to which section of the partition they occupy. if there are missing values, then create an extra bin for them.

  2. create the nominal variable z with j = j1j2 levels that assigns an index to observation i according to which levels of x1 and x2 it belongs. remove any levels of z that do not correspond to any observations.

  3. conduct a curvature test between z and y.

when growing decision trees, if there are important interactions between pairs of predictors, but there are also many other less important predictors in the data, then standard cart tends to miss the important interactions. however, conducting curvature and interaction tests for predictor selection instead can improve detection of important interactions, which can yield more accurate decision trees.

for more details on how the interaction test applies to growing decision trees, see curvature test, node splitting rules and [3].

predictive measure of association

the predictive measure of association is a value that indicates the similarity between decision rules that split observations. among all possible decision splits that are compared to the optimal split (found by growing the tree), the best surrogate decision split yields the maximum predictive measure of association. the second-best surrogate split has the second-largest predictive measure of association.

suppose xj and xk are predictor variables j and k, respectively, and j ≠ k. at node t, the predictive measure of association between the optimal split xj < u and a surrogate split xk < v is

λjk=min(pl,pr)−(1−pljlk−prjrk)min(pl,pr).

  • pl is the proportion of observations in node t, such that xj < u. the subscript l stands for the left child of node t.

  • pr is the proportion of observations in node t, such that xj ≥ u. the subscript r stands for the right child of node t.

  • pljlk is the proportion of observations at node t, such that xj < u and xk < v.

  • prjrk is the proportion of observations at node t, such that xj ≥ u and xk ≥ v.

  • observations with missing values for xj or xk do not contribute to the proportion calculations.

λjk is a value in (–∞,1]. if λjk > 0, then xk < v is a worthwhile surrogate split for xj < u.

surrogate decision splits

a surrogate decision split is an alternative to the optimal decision split at a given node in a decision tree. the optimal split is found by growing the tree; the surrogate split uses a similar or correlated predictor variable and split criterion.

when the value of the optimal split predictor for an observation is missing, the observation is sent to the left or right child node using the best surrogate predictor. when the value of the best surrogate split predictor for the observation is also missing, the observation is sent to the left or right child node using the second-best surrogate predictor, and so on. candidate splits are sorted in descending order by their predictive measure of association.

tips

  • by default, prune is 'on'. however, this specification does not prune the classification tree. to prune a trained classification tree, pass the classification tree to prune.

  • after training a model, you can generate c/c code that predicts labels for new data. generating c/c code requires matlab coder™. for details, see introduction to code generation.

algorithms

node splitting rules

fitctree uses these processes to determine how to split node t.

  • for standard cart (that is, if predictorselection is 'allpairs') and for all predictors xi, i = 1,...,p:

    1. fitctree computes the weighted impurity of node t, it. for supported impurity measures, see splitcriterion.

    2. fitctree estimates the probability that an observation is in node t using

      p(t)=∑j∈twj.

      wj is the weight of observation j, and t is the set of all observation indices in node t. if you do not specify prior or weights, then wj = 1/n, where n is the sample size.

    3. fitctree sorts xi in ascending order. each element of the sorted predictor is a splitting candidate or cut point. fitctree stores any indices corresponding to missing values in the set tu, which is the unsplit set.

    4. fitctree determines the best way to split node t using xi by maximizing the impurity gain (δi) over all splitting candidates. that is, for all splitting candidates in xi:

      1. fitctree splits the observations in node t into left and right child nodes (tl and tr, respectively).

      2. fitctree computes δi. suppose that for a particular splitting candidate, tl and tr contain observation indices in the sets tl and tr, respectively.

        • if xi does not contain any missing values, then the impurity gain for the current splitting candidate is

          δi=p(t)it−p(tl)itl−p(tr)itr.

        • if xi contains missing values then, assuming that the observations are missing at random, the impurity gain is

          δiu=p(t−tu)it−p(tl)itl−p(tr)itr.

          t – tu is the set of all observation indices in node t that are not missing.

        • if you use surrogate decision splits, then:

          1. fitctree computes the predictive measures of association between the decision split xj < u and all possible decision splits xk < v, j ≠ k.

          2. fitctree sorts the possible alternative decision splits in descending order by their predictive measure of association with the optimal split. the surrogate split is the decision split yielding the largest measure.

          3. fitctree decides the child node assignments for observations with a missing value for xi using the surrogate split. if the surrogate predictor also contains a missing value, then fitctree uses the decision split with the second largest measure, and so on, until there are no other surrogates. it is possible for fitctree to split two different observations at node t using two different surrogate splits. for example, suppose the predictors x1 and x2 are the best and second best surrogates, respectively, for the predictor xi, i ∉ {1,2}, at node t. if observation m of predictor xi is missing (i.e., xmi is missing), but xm1 is not missing, then x1 is the surrogate predictor for observation xmi. if observations x(m 1),i and x(m 1),1 are missing, but x(m 1),2 is not missing, then x2 is the surrogate predictor for observation m 1.

          4. fitctree uses the appropriate impurity gain formula. that is, if fitctree fails to assign all missing observations in node t to children nodes using surrogate splits, then the impurity gain is δiu. otherwise, fitctree uses δi for the impurity gain.

      3. fitctree chooses the candidate that yields the largest impurity gain.

    fitctree splits the predictor variable at the cut point that maximizes the impurity gain.

  • for the curvature test (that is, if predictorselection is 'curvature'):

    1. fitctree conducts curvature tests between each predictor and the response for observations in node t.

      • if all p-values are at least 0.05, then fitctree does not split node t.

      • if there is a minimal p-value, then fitctree chooses the corresponding predictor to split node t.

      • if more than one p-value is zero due to underflow, then fitctree applies standard cart to the corresponding predictors to choose the split predictor.

    2. if fitctree chooses a split predictor, then it uses standard cart to choose the cut point (see step 4 in the standard cart process).

  • for the interaction test (that is, if predictorselection is 'interaction-curvature' ):

    1. for observations in node t, fitctree conducts curvature tests between each predictor and the response and interaction tests between each pair of predictors and the response.

      • if all p-values are at least 0.05, then fitctree does not split node t.

      • if there is a minimal p-value and it is the result of a curvature test, then fitctree chooses the corresponding predictor to split node t.

      • if there is a minimal p-value and it is the result of an interaction test, then fitctree chooses the split predictor using standard cart on the corresponding pair of predictors.

      • if more than one p-value is zero due to underflow, then fitctree applies standard cart to the corresponding predictors to choose the split predictor.

    2. if fitctree chooses a split predictor, then it uses standard cart to choose the cut point (see step 4 in the standard cart process).

tree depth control

  • if mergeleaves is 'on' and prunecriterion is 'error' (which are the default values for these name-value pair arguments), then the software applies pruning only to the leaves and by using classification error. this specification amounts to merging leaves that share the most popular class per leaf.

  • to accommodate maxnumsplits, fitctree splits all nodes in the current layer, and then counts the number of branch nodes. a layer is the set of nodes that are equidistant from the root node. if the number of branch nodes exceeds maxnumsplits, fitctree follows this procedure:

    1. determine how many branch nodes in the current layer must be unsplit so that there are at most maxnumsplits branch nodes.

    2. sort the branch nodes by their impurity gains.

    3. unsplit the number of least successful branches.

    4. return the decision tree grown so far.

    this procedure produces maximally balanced trees.

  • the software splits branch nodes layer by layer until at least one of these events occurs:

    • there are maxnumsplits branch nodes.

    • a proposed split causes the number of observations in at least one branch node to be fewer than minparentsize.

    • a proposed split causes the number of observations in at least one leaf node to be fewer than minleafsize.

    • the algorithm cannot find a good split within a layer (i.e., the pruning criterion (see prunecriterion), does not improve for all proposed splits in a layer). a special case is when all nodes are pure (i.e., all observations in the node have the same class).

    • for values 'curvature' or 'interaction-curvature' of predictorselection, all tests yield p-values greater than 0.05.

    maxnumsplits and minleafsize do not affect splitting at their default values. therefore, if you set 'maxnumsplits', splitting might stop due to the value of minparentsize, before maxnumsplits splits occur.

parallelization

for dual-core systems and above, fitctree parallelizes training decision trees using intel® threading building blocks (tbb). for details on intel tbb, see .

cost, prior, and weights

if you specify the cost, prior, and weights name-value arguments, the output model object stores the specified values in the cost, prior, and w properties, respectively. the cost property stores the user-specified cost matrix as is. the prior and w properties store the prior probabilities and observation weights, respectively, after normalization. for details, see .

references

[1] breiman, l., j. friedman, r. olshen, and c. stone. classification and regression trees. boca raton, fl: crc press, 1984.

[2] coppersmith, d., s. j. hong, and j. r. m. hosking. “partitioning nominal attributes in decision trees.” data mining and knowledge discovery, vol. 3, 1999, pp. 197–217.

[3] loh, w.y. “regression trees with unbiased variable selection and interaction detection.” statistica sinica, vol. 12, 2002, pp. 361–386.

[4] loh, w.y. and y.s. shih. “split selection methods for classification trees.” statistica sinica, vol. 7, 1997, pp. 815–840.

extended capabilities

version history

introduced in r2014a

see also

| | | |

topics

    网站地图