文件名称:ID3
介绍说明－－下载内容来自于网络，使用问题请自行百度
ID3算法流程如下：
1.如果节点的所有类标号相同，停止分裂；
2.如果没有feature可供分裂，根据多数表决确定该节点的类标号，并停止分裂；
3.选择最佳分裂的feature，根据选择feature的值逐一进行分裂；递归地构造决策树。-ID3 algorithm process is as follows: 1. If the node is the same for all class label, stop dividing 2. If there is no feature for splitting the node class label is determined by a majority vote, and stop splitting 3. choose the best split feature, split one by one according to the value of feature selection recursively constructed tree.
1.如果节点的所有类标号相同，停止分裂；
2.如果没有feature可供分裂，根据多数表决确定该节点的类标号，并停止分裂；
3.选择最佳分裂的feature，根据选择feature的值逐一进行分裂；递归地构造决策树。-ID3 algorithm process is as follows: 1. If the node is the same for all class label, stop dividing 2. If there is no feature for splitting the node class label is determined by a majority vote, and stop splitting 3. choose the best split feature, split one by one according to the value of feature selection recursively constructed tree.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ID3.py
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.