申请试用
HOT
登录
注册
 
A Decision Tree for

A Decision Tree for

Arvind
/
发布于
/
1815
人观看
Example: C4.5 algorithm. Simple depth-first construction. Uses Information Gain; Sorts Continuous Attributes at each node. Needs entire data to fit in memory.
1 点赞
0 收藏
0下载
确认
3秒后跳转登录页面
去登陆