We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
第五章 决策树 习题5.3: 是不是还需要考虑t2和t3是子节点和父节点的情形,这时候直接在父节点处剪枝,得到唯一的最优子树
The text was updated successfully, but these errors were encountered:
能不能帮忙完善补充一下呢,谢谢了
Sorry, something went wrong.
No branches or pull requests
第五章 决策树 习题5.3: 是不是还需要考虑t2和t3是子节点和父节点的情形,这时候直接在父节点处剪枝,得到唯一的最优子树
The text was updated successfully, but these errors were encountered: