Advertisement

机器学习实践Scikit-Learn与TensorFlow练习题及问答Chapter06

阅读量:

Approximately what depth does a Decision tree reach when trained (without any restrictions) on a training dataset comprising one million instances?

A1: The depth of a well-balanced binary tree containing m leaves is equal to

log_{2}

, so when there is 1 million instances the approximate depth is

log_{2}

![\approx](https://ad.itadn.com/c/weblog/blog-img/images/2025-05-31/23ClId1SFGM0wgRi

全部评论 (0)

还没有任何评论哟~