网格搜索小练习
通过学习曲线的可视化来对比网格搜索得出的最优模型与非最优模型的区别，训练集和测试集的得分可以看出优化效果
默认的决策树模型是过拟合的状态，通过网格搜索得出最优模型的决策树的max-depth=4，进而获得最优模型及其得分
-
Notifications
You must be signed in to change notification settings - Fork 1
hahajing123/grid_search
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
网格搜索小练习
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published