GBDT Compared with the random forest algorithm, which of the following statements is wrong?
GBDT Algorithm is easier to underfit than random forest
Random forest is calculated in parallel, while GBDT Can't
GBDT Algorithm is easier to overfit than random forest
GBDT And random forest are built on CART Based on the tree
Submit