Algorithm | Parameters | Optimal Value |
---|---|---|
BARTm, BART | Number of trees | 50 |
Prior probability (k) | 2 | |
kNN | Number of neighbors | 27 |
SVM | Gamma parameter | 0.125 |
Cost of constraint violation | 1 | |
DT | Complexity parameter | 0.01 |
RF | Number of candidate variables at each split | 2 |
ANN | Number of the units in the hidden layer | 2 |
Decay weight parameter | 0.1 | |
GBM | Number of iterations | 150 |